#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());
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxhbGdvcml0aG0+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBGaW5kX2FYYV95KGludCB5KQp7CiAgICBpbnQgbCA9IDEgLCByID0gMTAwICwgbWlkID0gbCArIChyIC0gbCkgLyAyOwogICAgd2hpbGUobCA8IHIpCiAgICB7CiAgICAgICAgbWlkID0gbCArIChyIC0gbCkgLyAyOwogICAgICAgIGlmKDFMTCAqIG1pZCAqIG1pZCA+PSB5KQogICAgICAgICAgICByID0gbWlkOwogICAgICAgIGVsc2UKICAgICAgICAgICAgbCA9IG1pZCArIDE7CiAgICB9CiAgICByZXR1cm4geSAvIHIgPT0gciA/IHIgOiAtMTsKfQppbnQgYXJyWzExXSA9IHsyICwgMyAsIDQgLCA2ICwgOSAsIDEgLCAxMSAsIDggLCA2ICwgNCAsIDF9OwppbnQgRmluZF9NYXhWX2luX2luY19kZWNfcmFuZ2UoKQp7CiAgICBpbnQgbCA9IDAgLCByID0gMTAgLCBjdXJyX21pZCA9IDAgLCBtaWQgPSBsICsgKHIgLSBsICsgMSkgLyAyOwogICAgd2hpbGUobCA8IHIpCiAgICB7CiAgICAgICAgbWlkID0gbCArIChyIC0gbCArIDEpIC8gMjsKICAgICAgICBpZihhcnJbbWlkXSA+IGFycltjdXJyX21pZF0pCiAgICAgICAgICAgIGwgPSBtaWQgLCBjdXJyX21pZCA9IG1pZDsKICAgICAgICBlbHNlCiAgICAgICAgICAgIHIgPSBtaWQgLSAxOwogICAgfQogICAgcmV0dXJuIGFycltjdXJyX21pZF07Cn0KaW50IG1haW4oKQp7CiAgICAvL2ludCBuOwogICAgLy9zY2FuZigiJWQiICwgJm4pOwogICAgLy9wcmludGYoIiVkIiAsIEZpbmRfYVhhX3kobikpOwogICAgcHJpbnRmKCIlZCIgLCBGaW5kX01heFZfaW5faW5jX2RlY19yYW5nZSgpKTsKfQo=