




import sys

sys.set_int_max_str_digits(0)  # type: ignore



def      UpperCAmelCase_   (     __UpperCamelCase     ):
				SCREAMING_SNAKE_CASE__       =[0] * 11
				SCREAMING_SNAKE_CASE__       =[0] * 11

				# mark last 9 numbers
				for _ in range(9     ):
								SCREAMING_SNAKE_CASE__       =1
								SCREAMING_SNAKE_CASE__       =number // 10
				# flag
				SCREAMING_SNAKE_CASE__       =True

				# check last 9 numbers for pandigitality

				for x in range(9     ):
								if not check_last[x + 1]:
												SCREAMING_SNAKE_CASE__       =False
				if not f:
								return f

				# mark first 9 numbers
				SCREAMING_SNAKE_CASE__       =int(str(snake_case__     )[:9]     )

				for _ in range(9     ):
								SCREAMING_SNAKE_CASE__       =1
								SCREAMING_SNAKE_CASE__       =number // 10

				# check first 9 numbers for pandigitality

				for x in range(9     ):
								if not check_front[x + 1]:
												SCREAMING_SNAKE_CASE__       =False
				return f



def      UpperCAmelCase_   (     __UpperCamelCase     ):
				SCREAMING_SNAKE_CASE__       =[0] * 11

				# mark last 9 numbers
				for _ in range(9     ):
								SCREAMING_SNAKE_CASE__       =1
								SCREAMING_SNAKE_CASE__       =number // 10
				# flag
				SCREAMING_SNAKE_CASE__       =True

				# check last 9 numbers for pandigitality

				for x in range(9     ):
								if not check_last[x + 1]:
												SCREAMING_SNAKE_CASE__       =False
				return f



def      UpperCAmelCase_   (     ):
				SCREAMING_SNAKE_CASE__       =1
				SCREAMING_SNAKE_CASE__       =1
				SCREAMING_SNAKE_CASE__       =2
				# temporary Fibonacci numbers

				SCREAMING_SNAKE_CASE__       =1
				SCREAMING_SNAKE_CASE__       =1
				SCREAMING_SNAKE_CASE__       =2
				# temporary Fibonacci numbers mod 1e9

				# mod m=1e9, done for fast optimisation
				SCREAMING_SNAKE_CASE__       =[0] * 1_000_000
				SCREAMING_SNAKE_CASE__       =1_000_000_000

				for x in range(1_000_000     ):
								SCREAMING_SNAKE_CASE__       =(aa + ba) % m
								SCREAMING_SNAKE_CASE__       =ba % m
								SCREAMING_SNAKE_CASE__       =ca % m
								if checka(snake_case__     ):
												SCREAMING_SNAKE_CASE__       =1

				for x in range(1_000_000     ):
								SCREAMING_SNAKE_CASE__       =a + b
								SCREAMING_SNAKE_CASE__       =b
								SCREAMING_SNAKE_CASE__       =c
								# perform check only if in tocheck
								if tocheck[x + 3] and check(snake_case__     ):
												return x + 3  # first 2 already done
				return -1


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






