#include <stdio.h>
int BinarySearch(int a[],int n,int k)
{
int left,right,mid;
left=1;
right=n;
while(left<right)
{
mid=(left+right)/2;
if(k<a[mid]) right=mid-1;
else if(k>a[mid]) left=mid+1;
else return mid;
}
return -1;
}
int main()
{
int n,i,a[101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
int k,result;
scanf("%d",&k);
result=BinarySearch(a,n,k);
if(result==-1) printf("NOT FOUND");
else printf("%d",result);
return 0;
}
int BinarySearch(int a[],int n,int k)
{
int left,right,mid;
left=1;
right=n;
while(left<right)
{
mid=(left+right)/2;
if(k<a[mid]) right=mid-1;
else if(k>a[mid]) left=mid+1;
else return mid;
}
return -1;
}
int main()
{
int n,i,a[101];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
int k,result;
scanf("%d",&k);
result=BinarySearch(a,n,k);
if(result==-1) printf("NOT FOUND");
else printf("%d",result);
return 0;
}