






def 		_a					(   a				:int			,							a				:int			,							a				:int				)							->    Any:

 if power < 0:
  return -1
 base %= mod
 a							=   1

 while power > 0:
  if power & 1:
   a							=   (result * base) % mod
  a							=   power >> 1
  a							=   (base * base) % mod

 return result
def 		_a					(   )							->    int:
 print(modular_exponential(3			,							200			,							13				)				)


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     main()










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


