#include <cstdio>
using namespace std;
int v[100005],n,m,a,b,i;
int f0(int x)
{
	int li=1,ls=n,rez=-1,mij;
	while(li<=ls)
	{
		mij=(li+ls)/2;
		if(v[mij]==x) { rez=mij; li=mij+1; }
		if(v[mij]<x) { li=mij+1;}
		if(v[mij]>x) { ls=mij-1;}
	}

	return rez;
}
int f1(int x)
{
    int li=1,ls=n,rez=-1,mij;
    while (li<=ls)
    {
        mij=(li+ls)/2;
        if (v[mij]<=x) { rez=mij; li=mij+1;}
        else ls=mij-1;
    }
    return rez;
}
int f2(int x)
{
    int li=1,ls=n,rez=-1,mij;
    while (li<=ls)
    {
        mij=(li+ls)/2;
        if (v[mij]>=x) {rez=mij; ls=mij-1;}
        else li=mij+1;
    }
    return rez;
}
int main()
{
	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);
	for(i=1;i<=m;i++)
	{
		scanf("%d %d",&a,&b);
		if(a==0)printf("%d\n",f0(b));
		if(a==1)printf("%d\n",f1(b));
		if(a==2)printf("%d\n",f2(b));
	}
	fclose(stdin);
	return 0;
}