#include 
#include 
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector v(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }
    sort(v.begin(), v.end());
    int x;
    cin >> x;
    
    int idx = lower_bound(v.begin(), v.end(), x) - v.begin();
    
    if(idx >= 0 and idx < v.size()) {
        cout << v[idx] << endl;
    }
   return 0;
}