




def      UpperCAmelCase_   (     __UpperCamelCase = 30     ):
    SCREAMING_SNAKE_CASE__       =exponent + 2
    SCREAMING_SNAKE_CASE__       =(1 + 5**0.5) / 2
    SCREAMING_SNAKE_CASE__       =(phi**fibonacci_index - (phi - 1) ** fibonacci_index) / 5**0.5

    return int(__UpperCamelCase     )


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












def      UpperCAmelCase_   (     __UpperCamelCase,    __UpperCamelCase     ):
    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      UpperCAmelCase_   (     __UpperCamelCase,    __UpperCamelCase     ):
    for i in range(0,    __UpperCamelCase     ):
        print(arr[i],    end=""" """     )


# Driver program to test above function
lowerCamelCase_  						=       [10, 4, 5, 90, 120, 80]
lowerCamelCase_  						=       [0 for i in range(len(price) + 1)]

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




print_array(S, len(price))






