#include <iostream>
#include<string>
#include<vector>
#include<sstream>
using namespace std;
/*int fun1() {
    给n个信封的长度和宽度。如果信封A的长度和宽度都小于信封B，new
    ，那么信封可以放入到信封B里，请求出信封最多可以嵌套多少层?

    map<int, set<int>> all_mail;

    int n = 0;
    cin >> n;
    int len = 0, wid = 0;
    for(int i = 0; i < n; i++) {
        cin >> len >> wid;
        if(all_mail.find(len) != all_mail.end()) {
            set<int> tmp;
            all_mail[len] = tmp;
        }
            all_mail[len].insert(wid);

    }
    // all_mail 存放  长度->最小宽度的信封,找出最长连续的区间即可
    int s = 0; int e = 0;int max_len = 1;
    int min_width;
    auto it = all_mail.begin();
    auto it2 = ++all_mail.begin();
    while(it!= all_mail.end() && it2 != all_mail.end()){
        min_width = *it->second.begin();//开始取最小
        while(it2!=all_mail.end()) {
            if(upper_bound(it2->second.begin(), it2->second.end(), min_width) != it2->second.end()) {//可以装下
                min_width = *upper_bound(it2->second.begin(), it2->second.end(), min_width);
                it2++;
                e++;
            }else{
                break;
            }
        }
        if(e-s+1>max_len){
            max_len = s-e+1;
        }
        it = it2;
        it2++;
        s++;
    }

    return max_len;
}*/

int minNum(vector<int> array, int low, int high){
    int min = array[low];
    for(int i = low; i <= high; i++) {
        if(min > array[i]) {
            min = array[i];
            break;//只可能发生一次交换
        }
    }
    return min;
}
int minNumberInRotateArray(vector<int> rotateArray) {
   int len = rotateArray.size();
   if(len == 0) {//数组空
       return 0;
   }
   if(rotateArray[0] < rotateArray[len-1] || len == 1) { //特殊情况1数组全有序
       return rotateArray[0];
   }
   int low = 0, high = len - 1;
   int mid = (low + high) /2;
   while(high - low != 1){
       if(rotateArray[low] == rotateArray[high]){ // 特殊情况2无法判断mid属于那一段
           //改用顺序遍历查找
           return minNum(rotateArray, low, high);
       }
       if(rotateArray[mid] >= rotateArray[low]) { //属于前一段
           low = mid;
           mid = (low + high)/2;
       }else {
           high = mid;
           mid = (low + high)/2;
       }
   }
   return rotateArray[high];

}
int main()
{
    vector<int> input;
    string line;
    getline(cin, line);
    stringstream ss(line);
    int a;
    while(ss >> a) {
        input.push_back(a);
    }
    cout << minNumberInRotateArray(input);
    return 0;
}