#include<cstdio>
#include<cstdlib>
#define MAXN 100001
int n,m,v[MAXN];

void cautare0(int x)
{
int st=1,dr=n,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
st=mij+1;
else
dr=mij-1;
}
 mij=(st+dr)/2;
 if(v[mij]>x)mij--;
 if(v[mij]==x)
printf("%d\n",mij);
 else
printf("-1\n");
}

void cautare1(int x)
{
int st=1,dr=n,mij;

while(st<dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
st=mij+1;
else
dr=mij;
}
mij=(st+dr)/2;
if(v[mij]>x) mij--;
printf("%d\n",mij);
}

void cautare2(int x)
{
int st=1,dr=n,mij;
while(st<dr)
{
mij=(st+dr)/2;
if(v[mij]<x)
st=mij+1;
else
dr=mij;
}
mij=(st+dr)/2;
if(v[mij]<x) mij++;
printf("%d\n",mij);
}

int main()
{
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    int i,op,x;
    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",&op,&x);
  if(op==0)
   cautare0(x);
  if(op==1)
    cautare1(x);
  if(op==2)
   cautare2(x);
    }
    return 0;
}