

'''simple docstring'''
def  _lowerCAmelCase      (		_UpperCamelCase		:  Optional[int]							,				_UpperCamelCase		:  Optional[Any]       )   ->    Tuple:
     """simple docstring"""




     _SCREAMING_SNAKE_CASE												=len(_UpperCamelCase       )
     # Create a stack and push index of fist element to it
     _SCREAMING_SNAKE_CASE												=[]
     st.append(0       )

     # Span value of first element is always 1
     _SCREAMING_SNAKE_CASE												=1

     # Calculate span values for rest of the elements
     for i in range(1							,				_UpperCamelCase       ):
          # Pop elements from stack while stack is not
          # empty and top of stack is smaller than price[i]
          while len(_UpperCamelCase       ) > 0 and price[st[0]] <= price[i]:
               st.pop()

          # If stack becomes empty, then price[i] is greater
          # than all elements on left of it, i.e. price[0],
          # price[1], ..price[i-1]. Else the price[i]  is
          # greater than elements after top of stack
          _SCREAMING_SNAKE_CASE												=i + 1 if len(_UpperCamelCase       ) <= 0 else (i - st[0])

          # Push this element to stack
          st.append(_UpperCamelCase       )


def  _lowerCAmelCase      (		_UpperCamelCase		:  Any							,				_UpperCamelCase		:  str       )   ->    Any:
     """simple docstring"""




     for i in range(0							,				_UpperCamelCase       ):
          print(arr[i]							,				end=' '       )


# Driver program to test above function
lowerCamelCase				:   str      				=  [1_0, 4, 5, 9_0, 1_2_0, 8_0]
lowerCamelCase				:   str      				=  [0 for i in range(len(price) + 1)]

# Fill the span values in array S[]
calculation_span(price, S)







print_array(S, len(price))



'''simple docstring'''
def  _lowerCAmelCase      (		_UpperCamelCase		:  list       )   ->    list:
     """simple docstring"""




     for i, _ in enumerate(_UpperCamelCase       ):
          if (i % 2 == 1) == (nums[i - 1] > nums[i]):
               _SCREAMING_SNAKE_CASE					,		_SCREAMING_SNAKE_CASE												=nums[i], nums[i - 1]

     return nums


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