#include<bits/stdc++.h>
using namespace std;

int floorserach(int arr[],int n,int x)
{
    if(x>=arr[n-1])
    return n-1;
    if(x<arr[0])
    return -1;
    int low=0;high=n-1;
    while(low<high)
    {
        if(arr[i]==x)
        return mid;
        else if(arr[i]<x)
        low=mid+1;
        else
        high=low;
    }
    return (low-1);
    
}
int main()
{
    int n;
    cin>>n;
    int arr[n];
    for(int i=0;i<n;i++)
    {
        cin>>arr[i];
    }
    int x;
    cin>>x;
    int index=floorsearch(arr,,n,x);
    if(index=-1)
    cout<<" eleofvoirboi"<<x<<"wfffebgrgvfevfrgbgv"<<endl;
    else
    {
        cout<<<<<"rtfygyuiunk"<<x<<"ifv"<<arr[inde]<<"egfvuygvirgv"<<endl;
    }
    return 0;
}