#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

int main(){
	int n;
	int d[120];
	while(cin>>n,n){
		memset(d, 0, sizeof(d));
		rep(i, n){
			cin>>d[i];
		}
		int x;
		cin>>x;
		int left,right,cnt;
		left =0;
		right =n-1;
		cnt = 0;
		while(right-left>=0){
			int pos =(right+left)/2;
			//cout <<"pos = "<<pos<<endl;
			if(d[pos]<x){
				cnt++;
				left =pos+1;
			}else if(d[pos]>x){
				cnt++;
				right =pos-1;
			}else{
				cnt++;
				break;
			}
		}
		cout <<cnt<<endl;
	}
	return 0;
}