#include<stdio.h>
int binarysearch(int a[],int x,int m,int n)
	{
		int left=0;
		int right=n-1;
		while(left<=right)
		{
			int middle=(left+right)/2;
			if(x==a[middle])  return middle;
			if(x>a[middle])
				binarysearch(a,x,middle+1,n);
			else 
				binarysearch(a,x,m,middle-1);
		}
		return -1;
	}
void main()
{
	int i=0,x=0,a[10];

	scanf("%d/n",&x);
	for(i=0;i<10;i++)
	{	scanf("%d/n",&a[i]);
	}
	binarysearch(a,x,0,10);
}