






def 		_a					(   a				:int				)							->    int:
 return n * (2 * n - 1)
def 		_a					(   a				:int				)							->    bool:
 a							=   (1 + 24 * n) ** 0.5
 return ((1 + root) / 6) % 1 == 0
def 		_a					(   a				:int = 144				)							->    int:
 a							=   start
 a							=   hexagonal_num(a				)
 while not is_pentagonal(a				):
  n += 1
  a							=   hexagonal_num(a				)
 return num


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










def 		_a					(   a				:list				)							->    list:
 for i, _ in enumerate(a				):
  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:")
     UpperCAmelCase__            =	list(map(int, input().split()))
     print("The unsorted array is:")
     print(array)
     print("Array after Wiggle sort:")
     print(wiggle_sort(array))


