/** #include <fstream>

using namespace std;

int N, mij, v[100001];
ifstream f("cautbin.in");
ofstream g("cautbin.out");

void cautare(int x)
{
    int p, q;
    p=1;
    q=N;
    while(p<=q)
    {
        mij=(p+q)/2;
        if(v[mij]==x)
            break;
        else if(v[mij]>x)
            p=mij-1;
        else if(v[mij]<x)
            p=mij+1;
    }
}

int main()
{
    f>>N;
    for(int i=1; i<=N; ++i)
        f>>v[i];
    int M, optiune, x;
    f>>M;
    for(int i=1; i<=M; ++i)
    {
        f>>optiune>>x;
        if(optiune==0)
        {
            cautare(x);
            if(v[mij]!=x)
                g<<-1<<'\n';
            else
            {
                while(v[mij+1]==v[mij])
                    mij++;
                g<<mij<<'\n';
            }
        }
        if(optiune==1)
        {
            cautare(x);
            if(v[mij]==x)
            {
                while(v[mij+1]==v[mij])
                    mij++;
            }
            else if(v[mij]>x)
                mij--;
            g<<mij<<'\n';
        }
        if(optiune==2)
        {
            cautare(x);
            if(v[mij]==x)
            {
                while(v[mij-1]==v[mij])
                    mij--;
            }
            else if(v[mij]<x)
                mij++;
            g<<mij<<'\n';
        }
    }
    return 0;
} **/
#include <fstream>

#include <iostream>



using namespace std;



ifstream in("cautbin.in");

ofstream out("cautbin.out");



int v[100001],mid,n;





void cautbin(int x) {

    int st = 1, dr = n;

    while (st <= dr) {

        mid = st + (dr - st) / 2;

        if (v[mid] == x)

            break;

        else if (v[mid] > x)

            dr = mid - 1;

        else

            st = mid + 1;

    }

}



int main() {



    in >> n;



    for (int i = 1; i <= n; i++) {

        in >> v[i];

    }





    int m, t, x;

    in >> m;



    for (int i = 1; i <= m; i++) {

        in >> t >> x;

        if (t == 0) {

            cautbin(x);



            if (v[mid] != x)

                out << -1 << '\n';

            else {

                while(v[mid+1]==v[mid])

                    mid++;

                out << mid << '\n';

            }



        }

        else if (t == 1) {

            cautbin(x);



            if(v[mid]==x) {

                while (v[mid + 1] == v[mid])

                    mid++;

            }

            else {

                if(v[mid]>x)

                    mid--;

            }

            out << mid << '\n';



        }

        else {

            cautbin(x);



            if(v[mid]==x) {

                while(v[mid-1]==v[mid])

                    mid--;

            }

            else {

                if(v[mid]<x)

                    mid++;

            }

            out << mid << '\n';

        }

    }



    return 0;

}