



"""simple docstring"""







import sys

sys.set_int_max_str_digits(0)  # type: ignore

def 	lowerCAmelCase__      (  lowerCamelCase__      )			->				bool:
							A    =       [0] * 11
							A    =       [0] * 11

							# mark last 9 numbers
							for _ in range(9      ):
														A    =       1
														A    =       number // 10
							# flag
							A    =       True

							# check last 9 numbers for pandigitality

							for x in range(9      ):
														if not check_last[x + 1]:
																					A    =       False
							if not f:
														return f

							# mark first 9 numbers
							A    =       int(str(lowerCamelCase__      )[:9]      )

							for _ in range(9      ):
														A    =       1
														A    =       number // 10

							# check first 9 numbers for pandigitality

							for x in range(9      ):
														if not check_front[x + 1]:
																					A    =       False
							return f

def 	lowerCAmelCase__      (  lowerCamelCase__      )			->				bool:
							A    =       [0] * 11

							# mark last 9 numbers
							for _ in range(9      ):
														A    =       1
														A    =       number // 10
							# flag
							A    =       True

							# check last 9 numbers for pandigitality

							for x in range(9      ):
														if not check_last[x + 1]:
																					A    =       False
							return f

def 	lowerCAmelCase__      (  )			->				int:
							A    =       1
							A    =       1
							A    =       2
							# temporary Fibonacci numbers

							A    =       1
							A    =       1
							A    =       2
							# temporary Fibonacci numbers mod 1e9

							# mod m=1e9, done for fast optimisation
							A    =       [0] * 1000000
							A    =       1000000000

							for x in range(1000000      ):
														A    =       (aa + ba) % m
														A    =       ba % m
														A    =       ca % m
														if checka(lowerCamelCase__      ):
																					A    =       1

							for x in range(1000000      ):
														A    =       a + b
														A    =       b
														A    =       c
														# perform check only if in tocheck
														if tocheck[x + 3] and check(lowerCamelCase__      ):
																					return x + 3  # first 2 already done
							return -1


if __name__ == "__main__":
							print(F'{solution() = }')








"""simple docstring"""







def 	lowerCAmelCase__      (  lowerCamelCase__      )			->				list:
							for i, _ in enumerate(lowerCamelCase__      ):
														if (i % 2 == 1) == (nums[i - 1] > nums[i]):
																					A   ,	A    =       nums[i], nums[i - 1]

							return nums


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



