#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,v[100001],i;
int a,b;
int st,dr;
long long mid;
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>v[i];
    fin>>m;
    for(i=1;i<=m;i++){
        fin>>a>>b;
        if(a==0){
            st=1;
            dr=n;
            while(st<=dr){
                mid=(st+dr)/2;
                if(v[mid]<=b)
                    st=mid+1;
                else
                    dr=mid-1;
            }
            if(v[dr]==b)
                fout<<dr<<"\n";
            else
                fout<<-1<<"\n";
        }
        else
            if(a==1){
                st=1;
                dr=n;
                while(st<=dr){
                    mid=(st+dr)/2;
                    if(v[mid]<=b)
                        st=mid+1;
                    else
                        dr=mid-1;
                }
                fout<<dr<<"\n";
            }
            else{
                st=1;
                dr=n;
                while(st<=dr){
                    mid=(st+dr)/2;
                    if(v[mid]<b)
                        st=mid+1;
                    else
                        dr=mid-1;
                }
                fout<<st<<"\n";
            }
    }

    return 0;
}