#include<stdio.h>
#include<cmath>
#include<iostream>
#include<vector>
using namespace std;
int BinarySearch(vector<int>& A, int l, int r, int key)
{
int m ;
if(A[r-1] < key )
return r;
if(A[0] > key)
return 0;
while( r > l )
{
m = (r+l)/2;
if( A[m] >= key && A[m-1] < key )
return m;
else if(A[m] > key)
r = m;
else
l = m;
cout << l << " "<< m <<" " << r << " " << r -l << endl ;
}
}
int main()
{
int t,i , np, nl, c, x, y, j , k;
vector<int> points;
freopen("in.txt", "rt", stdin);
scanf("%d",&t);
points.reserve(t);
for(i=0; i<t; i++){
scanf("%d",&points[i]);
}
scanf("%d %d",&x, &y);
k = BinarySearch(points, 0, t, x);
cout << k << endl;
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8Y21hdGg+CiNpbmNsdWRlPGlvc3RyZWFtPgojaW5jbHVkZTx2ZWN0b3I+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgoKCmludCBCaW5hcnlTZWFyY2godmVjdG9yPGludD4mIEEsIGludCBsLCBpbnQgciwgaW50IGtleSkKewogICAgaW50IG0gOwogICAgaWYoQVtyLTFdIDwga2V5ICkKICAgICAgICByZXR1cm4gcjsKICAgIGlmKEFbMF0gPiBrZXkpCiAgICAgICAgcmV0dXJuIDA7CgogICAgd2hpbGUoIHIgPiBsICkKICAgIHsKICAgICAgICBtID0gKHIrbCkvMjsKCiAgICAgICAgaWYoIEFbbV0gPj0ga2V5ICYmIEFbbS0xXSA8IGtleSApCiAgICAgICAgICAgIHJldHVybiBtOwogICAgICAgIGVsc2UgaWYoQVttXSA+IGtleSkKICAgICAgICAgICAgciA9IG07CiAgICAgICAgZWxzZQogICAgICAgICAgICBsID0gbTsKICAgICAgICBjb3V0IDw8IGwgPDwgIiAiPDwgbSA8PCIgIiA8PCByIDw8ICIgIiA8PCByIC1sIDw8IGVuZGwgOwogICAgfQp9CgppbnQgbWFpbigpCnsKICAgIGludCB0LGkgLCBucCwgbmwsIGMsIHgsIHksIGogLCBrOwogICAgdmVjdG9yPGludD4gcG9pbnRzOwogICAgZnJlb3BlbigiaW4udHh0IiwgInJ0Iiwgc3RkaW4pOwogICAgc2NhbmYoIiVkIiwmdCk7CiAgICBwb2ludHMucmVzZXJ2ZSh0KTsKICAgIGZvcihpPTA7IGk8dDsgaSsrKXsKICAgICAgICBzY2FuZigiJWQiLCZwb2ludHNbaV0pOwogICAgfQogICAgc2NhbmYoIiVkICVkIiwmeCwgJnkpOwogICAgayA9IEJpbmFyeVNlYXJjaChwb2ludHMsIDAsIHQsIHgpOwogICAgY291dCA8PCBrIDw8IGVuZGw7CiAgICByZXR1cm4gMDsKfQo=