





def        A__						(							SCREAMING_SNAKE_CASE_		) ->  list:
		for i, _ in enumerate(SCREAMING_SNAKE_CASE_		):
				if (i % 2 == 1) == (nums[i - 1] > nums[i]):
						lowerCamelCase		, lowerCamelCase :			Tuple    		=nums[i], nums[i - 1]

		return nums


if __name__ == "__main__":
				print('''Enter the array elements:''')
				snake_case_				=      list(map(int, input().split()))
				print('''The unsorted array is:''')
				print(array)
				print('''Array after Wiggle sort:''')
				print(wiggle_sort(array))








def        A__						(							SCREAMING_SNAKE_CASE_				,							SCREAMING_SNAKE_CASE_		) ->  Union[str, Any]:
		if n < 0:
				return 0
		# table[i] represents the number of ways to get to amount i
		lowerCamelCase :			int    		=[0] * (n + 1)

		# There is exactly 1 way to get to zero(You pick no coins).
		lowerCamelCase :			List[Any]    		=1

		# Pick all coins one by one and update table[] values
		# after the index greater than or equal to the value of the
		# picked coin
		for coin_val in s:
				for j in range(SCREAMING_SNAKE_CASE_				,							n + 1		):
						table[j] += table[j - coin_val]

		return table[n]


if __name__ == "__main__":
				import doctest

				doctest.testmod()

