#include<stdio.h>
#include<algorithm>
#include<utility>
#define N 100100
using namespace std;
int n,m,x,i,c,D,U,v[N];
void read(),solve();
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("cautbin.in","r",stdin);
	freopen("cautbin.out","w",stdout);
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		scanf("%d",&v[i]);
	scanf("%d",&m);
}
void solve()
{
	for(;m;m--)
	{
		scanf("%d%d",&c,&x);
		if(c==2){printf("%d\n",lower_bound(v+1,v+n+1,x)-v);continue;}
		if(c==1){printf("%d\n",upper_bound(v+1,v+n+1,x)-v-1);continue;}
		pair<int*,int*> r=equal_range(v+1,v+n+1,x);
		D=r.first-v;U=r.second-v-1;
		U<D?printf("-1\n"):printf("%d\n",U);
	}
}