





from itertools import combinations_with_replacement




def 			lowerCAmelCase_			(				UpperCamelCase_ = 100	)  ->		int:
       UpperCamelCase_ 							=	[*list(range(1       ,		21	)	), 25]
       UpperCamelCase_ 							=	[2 * x for x in range(1       ,		21	)] + [50]
       UpperCamelCase_ 							=	[3 * x for x in range(1       ,		21	)]
       UpperCamelCase_ 							=	singles + doubles + triples + [0]

       UpperCamelCase_ 							=	0
       UpperCamelCase_ 							=	42
       UpperCamelCase_ 							=	42
       UpperCamelCase_ 							=	42
       UpperCamelCase_ 							=	42

       for double in doubles:
              for throwa, throwa in combinations_with_replacement(lowerCamelCase__       ,		2	):
                     UpperCamelCase_ 							=	double + throwa + throwa
                     if checkout_total < limit:
                            num_checkouts += 1

       return num_checkouts


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))



