'''
BITONIC POINT

Given an array. The task is to find the bitonic point of the array.
The bitonic point in an array is the index before which all the numbers
are in increasing order and after which, all are in decreasing order.
'''

def bitonic(a, n):
    l = 1
    r = n - 2
    while(l <= r):
        m = (l + r) // 2
        if (a[m] > a[m - 1] and a[m + 1] < a[m]):
            return m
        if (a[m] < a[m + 1]):
            l = m + 1 
        else:
            r = m - 1
    return -1

n = int(input())
a = [int(x) for x in input().split()]
point = bitonic(a, n)
if (point == -1):
    print("There is no bitonic point")
else:
    print("The bitonic point is", point)

'''
INPUT :
n = 6
a = [1 4 8 4 2 1]
OUTPUT :
The bitonic point is 2
'''

'''
BITONIC POINT

Given an array. The task is to find the bitonic point of the array.
The bitonic point in an array is the index before which all the numbers
are in increasing order and after which, all are in decreasing order.
'''

def bitonic(a, n):
    l = 1
    r = n - 2
    while(l <= r):
        m = (l + r) // 2
        if (a[m] > a[m - 1] and a[m + 1] < a[m]):
            return m
        if (a[m] < a[m + 1]):
            l = m + 1 
        else:
            r = m - 1
    return -1

n = int(input())
a = [int(x) for x in input().split()]
point = bitonic(a, n)
if (point == -1):
    print("There is no bitonic point")
else:
    print("The bitonic point is", point)

'''
INPUT :
n = 6
a = [1 4 8 4 2 1]
OUTPUT :
The bitonic point is 2
'''

BITONIC POINT  Given an array. The task is to find the bitonic point of the array. The bitonic point in an array is the index before which all the numbers are in increasing order and after which, all are in decreasing order. INPUT : n = 6 a = [1 4 8 4 2 1] OUTPUT : The bitonic point is 2