#include<bits/stdc++.h>
using namespace std;
int a[1000010],n,m,x,x1;
int caut0(int st,int dr){
	while (st<=dr){
		m=(dr+st)/2+st;
			if (a[m]<=x)st=m+1;
			else
				dr=m-1;
	}
	if (a[dr]==x)return dr;
			else
	return -1;
}
int caut1(int st,int dr){
	while (st<=dr){
		m=(dr+st)/2+st;
			if (a[m]<=x)st=m+1;
			else
				dr=m-1;
	}
	return dr;
}
int caut2(int st,int dr){
    while (st<=dr){
		m=(dr+st)/2+st;
			if (a[m]<x)st=m+1;
			else
				dr=m-1;
	}
	return st;  
}
int main(){
	ifstream cin("cautbin.in");
	ofstream cout("cautbin.out");
	cin>>n;
	for(int i=1;i<=n;i++)
	    cin>>a[i];
	cin>>m;
	for(int i=1;i<=m;i++){
		cin>>x1>>x;
		if(x1==0){
			cout<<caut0(1,n)<<endl;
		}
		if(x1==1){
			cout<<caut1(1,n)<<endl;
		}
		if(x1==2){
			cout<<caut2(1,n)<<endl;
		}
	}
	return 0;
}