#include <fstream>
using namespace std;

int main()
{
    int N, M, x, i, p, q, ok, optiune, mij;
    ifstream f("cautbin.in");
    ofstream g("cautbin.out");
    f>>N;
    int v[N+1];
    for(i=1; i<=N; ++i)
        f>>v[i];
    f>>M;
    for(i=1; i<=M; ++i)
    {
        f>>optiune>>x;
        p=1;
        q=N-1;
        ok=0;
        if(optiune==0)
        {
            while(p<=q && ok==0)
            {
                mij=(p+q)/2;
                if(v[mij]==x && v[mij+1]!=x)
                    ok=1;
                else if(v[mij+1]==x)
                    {
                        while(v[mij+1]==x)
                            mij++;
                        ok=1;
                    }
                else if(x<v[mij])
                    q=mij-1;
                else if(x>v[mij])
                    p=mij+1;
            }
            if(ok==1)
                g<<mij<<'\n';
            else g<<-1<<'\n';
        }
        if(optiune==1)
            while(ok==0)
            {
                p=1;
                q=N;
                ok=0;
                while(p<=q && ok==0)
                {
                    mij=(p+q)/2;
                    if(v[mij]==x && v[mij+1]!=x)
                        ok=1;
                    else if(v[mij+1]==x)
                        {
                            while(v[mij+1]==x)
                                mij++;
                            ok=1;
                        }
                    else if(x<v[mij])
                        q=mij-1;
                    else if(x>v[mij])
                        p=mij+1;
                }
                if(ok==1)
                    g<<mij<<'\n';
                else x--;
            }
        if(optiune==2)
            while(ok==0)
            {
                p=1;
                q=N;
                ok=0;
                while(p<=q && ok==0)
                {
                    mij=(p+q)/2;
                    if(v[mij]==x && v[mij-1]!=x)
                        ok=1;
                    else if(v[mij-1]==x)
                        {
                            while(v[mij-1]==x)
                                mij--;
                            ok=1;
                        }
                    else if(x<v[mij])
                        q=mij-1;
                    else if(x>v[mij])
                        p=mij+1;
                }
                if(ok==1)
                    g<<mij<<'\n';
                else x++;
            }
    }
    return 0;
}