#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,i,j,v[100010],st,dr,val,c,a,b,mij,best;
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>v[i];

    fin>>c;
    for(i=1;i<=c;i++)
    {
        fin>>a>>b;
        if(a==0)
        {
            best=-1;
            val=b;
            st=1;
            dr=n;
            mij=st+(dr-st)/2;
            while(st<=dr)
            {
                mij=st+(dr-st)/2;
                if(v[mij]>val)
                    dr=mij-1;
                if(v[mij]<val)
                    st=mij+1;
                if(val==v[mij])
                {
                    best=mij;
                    st=mij+1;
                }
            }
            fout<<best<<'\n';
        }
        else if(a==1)
        {
            best=-1;
            val=b;
            st=1;
            dr=n;
            mij=st+(dr-st)/2;
            while(st<=dr)
            {
                mij=st+(dr-st)/2;
                if(v[mij]>val)
                    dr=mij-1;
                else if(v[mij]<val)
                    st=mij+1;
                if(val==v[mij])
                {
                    best=mij;
                    st=mij+1;
                }
            }
            fout<<best<<'\n';
        }
        else
        {
            best=-1;
            val=b;
            st=1;
            dr=n;
            while(st<=dr)
            {
                mij=st+(dr-st)/2;
                if(v[mij]>val)
                    dr=mij-1;
                else if(v[mij]<val)
                    st=mij+1;
                if(val==v[mij])
                {
                    best=mij;
                    dr=mij-1;
                }
            }
            fout<<best<<'\n';
        }
    }
    return 0;
}