#include <stdio.h>
#include <algorithm>
using namespace std;
int Find_aXa_y(int y)
{
    int l = 1 , r = 100 , mid = l + (r - l) / 2;
    while(l < r)
    {
        mid = l + (r - l) / 2;
        if(1LL * mid * mid >= y)
            r = mid;
        else
            l = mid + 1;
    }
    return y / r == r ? r : -1;
}
int arr[11] = {2 , 3 , 4 , 6 , 9 , 1 , 11 , 8 , 6 , 4 , 1};
int Find_MaxV_in_inc_dec_range()
{
    int l = 0 , r = 10 , curr_mid = 0 , mid = l + (r - l + 1) / 2;
    while(l < r)
    {
        mid = l + (r - l + 1) / 2;
        if(arr[mid] > arr[curr_mid])
            l = mid , curr_mid = mid;
        else
            r = mid - 1;
    }
    return arr[curr_mid];
}
int main()
{
    //int n;
    //scanf("%d" , &n);
    //printf("%d" , Find_aXa_y(n));
    printf("%d" , Find_MaxV_in_inc_dec_range());
}