#include<stdio.h>
#define N 50
void sort(int *p,int n)
{
int i,j,t;
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
if(p[i]<p[j])
{
t=p[i];
p[i]=p[j];
p[j]=t;
}
}
}
void find(int *p,int n,int m)
{
int low=0,high=n-1,mid;
while(low<=high)
{
mid=(low+high)/2;
if(p[mid]==m)
{
printf("%d\n",mid+1);
break;
}
else if(p[mid]>m)
{
low=mid+1;
}
else
{
high=mid-1;
}
}
if(low>high)
{
printf("wucishu!\n");
}
}
int main()
{
int a[N],i,n,m;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,n);
scanf("%d",&m);
find(a,n,m);
return 0;
}