#include <cstdio>
#include <algorithm>
using namespace std;
FILE*fin=fopen("cautbin.in","r");
FILE*fout=fopen("cautbin.out","w");
int a,i,n,val,j,k,t,nr;
int v[110000],m;
int main()
{
fscanf(fin,"%d",&n);
    for (i=0;i<n;i++)
    {
    fscanf(fin,"%d",&v[i]);
    }
    fscanf(fin,"%d",&m);
    for (i=1;i<=m;i++)
    {
        fscanf(fin,"%d%d",&t,&nr);
        switch(t)
        {case 0:{a=*(upper_bound(v,v+n,nr)-1);if (a==nr)fprintf(fout,"%d\n",upper_bound(v,v+n,nr)-v);else fprintf(fout,"-1\n");}break;
        case 1:{fprintf(fout,"%d\n",upper_bound(v,v+n,nr)-v);}break;
        case 2:{fprintf(fout,"%d\n",lower_bound(v,v+n,nr)-v+1);}break;}
    }
    return 0;
}