"""simple docstring"""







def 						_lowercase				(  _SCREAMING_SNAKE_CASE				:				Union[str, Any]						)    ->     str:







     '''simple docstring'''


     for i, _ in enumerate(lowerCAmelCase_						):
          if (i % 2 == 1) == (nums[i - 1] > nums[i]):
               __A					:					Tuple								=		nums[i], nums[i - 1]

     return nums


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










'''simple docstring'''

import math




def  _a     (				lowerCAmelCase_						):





      """simple docstring"""



      if 1 < number < 4:
            # 2 and 3 are primes
            return True
      elif number < 2 or number % 2 == 0 or number % 3 == 0:
            # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
            return False

      # All primes number are in format of 6k +/- 1
      for i in range(5      ,   int(math.sqrt(lowerCAmelCase_						) + 1						)      ,   6						):
            if number % i == 0 or number % (i + 2) == 0:
                  return False
      return True




def  _a     (				lowerCAmelCase_ = 2_000_000						):





      """simple docstring"""



      return sum(num for num in range(3      ,   lowerCAmelCase_      ,   2						) if is_prime(lowerCAmelCase_						)						) + 2 if n > 2 else 0


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


