#include <fstream>

using namespace std;

int n,m,v[100001];

int verif0(int i,int a)
{
    if(v[i+1]==a) verif0(i+1,a);
        else return i;
}

int verif(int i, int a)
{
    if(v[i-1]==a) verif(i-1,a);
        else return i;
}
int caut0(int a,int jos,int sus)
{
    if(v[(jos+sus)/2]==a) return verif0((jos+sus)/2,a);
        else if(jos==n or sus==1 or jos==sus) return -1;
    if(v[(jos+sus)/2]> a) return caut0(a,jos,(jos+sus)/2-1);
    if(v[(jos+sus)/2]< a) return caut0(a,(jos+sus)/2+1,sus);
}

int caut1(int a, int jos, int sus)
{
    if(v[(jos+sus)/2]==a) return verif0((jos+sus)/2,a);
        else if(sus-jos==1 and v[sus]!=a)
                    if(v[sus]<a) return sus;
                        else return jos;
    if(v[(jos+sus)/2]>a) return caut1(a,jos,(jos+sus)/2-1);
    if(v[(jos+sus)/2]<a) return caut1(a,(jos+sus)/2+1,sus);
}

int caut2(int a, int jos, int sus)
{
    if(v[(jos+sus)/2]==a) return verif((jos+sus)/2,a);
        else if(sus-jos==1 and v[sus]!=a)
                if(v[jos]>a) return jos;
                    else return sus;
    if(v[(jos+sus)/2]>a) return caut2(a,jos,(jos+sus)/2-1);
    if(v[(jos+sus)/2]<a) return caut2(a,(jos+sus)/2+1,sus);
}

int main()
{
    int i,a,b;
    ifstream mama("cautbin.in");
    ofstream tata("cautbin.out");
    mama>>n;
    for(i=1;i<=n;i++)
        mama>>v[i];
    mama>>m;
    for(i=1;i<=m;i++)
    {
        mama>>a>>b;
        if(a==0) tata<<caut0(b,1,n);
        if(a==1) tata<<caut1(b,1,n);
        if(a==2) tata<<caut2(b,1,n);
        tata<<'\n';
    }
    return 0;
}