#include<iostream>
using namespace std;
int arr[20], n = 10;
int main(){
for(int i = 0;i < 10;i++) cin >> arr[i];
int start = 0, end = n;
while(start <= end){
int mid = (start + end)/2;
if(mid - 1 >= 0 && mid + 1 <= n && arr[mid-1] >= arr[mid] && arr[mid] >= arr[mid+1]){
//decreasing part
end = mid-1;
}else if(mid - 1 >= 0 && mid + 1 <= n && arr[mid-1] <= arr[mid] && arr[mid] <= arr[mid+1]){
//increasing part
start = mid+1;
}else{
//answer found, take care of corner cases
cout << arr[mid] << endl;
break;
}
}
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IGFyclsyMF0sIG4gPSAxMDsKCmludCBtYWluKCl7CgkKCWZvcihpbnQgaSA9IDA7aSA8IDEwO2krKykgY2luID4+IGFycltpXTsKCglpbnQgc3RhcnQgPSAwLCBlbmQgPSBuOwoJd2hpbGUoc3RhcnQgPD0gZW5kKXsKICAgIAlpbnQgbWlkID0gKHN0YXJ0ICsgZW5kKS8yOwogICAgCWlmKG1pZCAtIDEgPj0gMCAmJiBtaWQgKyAxIDw9IG4gJiYgYXJyW21pZC0xXSA+PSBhcnJbbWlkXSAmJiBhcnJbbWlkXSA+PSBhcnJbbWlkKzFdKXsKICAgIAkgICAgLy9kZWNyZWFzaW5nIHBhcnQKICAgIAkgICAgZW5kID0gbWlkLTE7CiAgICAJfWVsc2UgaWYobWlkIC0gMSA+PSAwICYmIG1pZCArIDEgPD0gbiAmJiBhcnJbbWlkLTFdIDw9IGFyclttaWRdICYmIGFyclttaWRdIDw9IGFyclttaWQrMV0pewogICAgICAgCQkvL2luY3JlYXNpbmcgcGFydAogICAgICAgIAlzdGFydCA9IG1pZCsxOwogICAgCX1lbHNlewogICAgICAgIAkvL2Fuc3dlciBmb3VuZCwgdGFrZSBjYXJlIG9mIGNvcm5lciBjYXNlcwogICAgICAgIAljb3V0IDw8IGFyclttaWRdIDw8IGVuZGw7CiAgICAgICAgCWJyZWFrOwogICAgCX0KCX0KCglyZXR1cm4gMDsKfQ==