#include<iostream>
#include<fstream>
#include<math.h>
#include<algorithm>

using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,i,j,m,nr,x,st,dr,mid,v[100003];


int main(){
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>v[i];
    fin>>m;
    for(i=1;i<=m;i++)
    {
        fin>>nr>>x;
        if(nr==0)
        {
            st=1;
            dr=n;
            while(st<=dr)
            {
                mid=(st+dr)/2;
                if(v[mid]>x)
                    dr=mid-1;
                else
                    st=mid+1;
            }
            if(v[dr]==x)
                fout<<dr<<"\n";
            else
                fout<<-1<<"\n";
        }
        else
            if(nr==1)
            {
                st=1;
                dr=n;
                while(st<=dr)
                {
                    mid=(st+dr)/2;
                    if(v[mid]>x)
                        dr=mid-1;
                    else
                        st=mid+1;
                }
                fout<<dr<<"\n";
            }
            else
                if(nr==2)
                {
                    st=1;
                    dr=n;
                    while(st<=dr)
                    {
                        mid=(st+dr)/2;
                        if(v[mid]>=x)
                            dr=mid-1;
                        else
                            st=mid+1;
                    }
                    fout<<st<<"\n";
                }
    }
    fin.close();
    fout.close();
    return 0;
}