#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");

const int NMAX = 100000;
int N, v[NMAX + 1];

int caut0(int x)
{
    int p = 1, u = N, poz = -1;
    while(p <= u)
    {
        int m = (p + u) / 2;
        if(x == v[m])
            poz = m;
        if(x >= v[m])
            p = m + 1;
        else
            u = m - 1;
    }
    return poz;
}
//
int caut1(int x)
{
    int p = 1, u = N, poz = -1;
    while(p <= u)
    {
        int m = (p + u) / 2;
        if(x >= v[m])
        {
            poz = m;
            p = m + 1;
        }
        else
            u = m - 1;
    }
    return poz;
}
//
int caut2(int x)
{
    int p = 1, u = N, poz = -1;
    while(p <= u)
    {
        int m = (p + u) / 2;
        if(x <= v[m])
        {
            poz = m;
            u = m - 1;
        }
        else
            p = m + 1;
    }
    return poz;
}
//
int main()
{
    int M, x, t;
    f >> N;
    for(int i = 1; i <= N; i++)
        f >> v[i];
    f >> M;
    while(M--)
    {
        f >> t >> x;
        switch(t)
        {
        case 0:
            g << caut0(x) << '\n';
            break;
        case 1:
            g << caut1(x) << '\n';
            break;
        case 2:
            g << caut2(x) << '\n';
            break;
        }
    }
    return 0;
}




/**

    int v[100001], M, N, y, x;
    /// y = tipul intrebarii    x = nr cautat
    f >> N;
    for(int i = 1; i <= N; i++)
        f >> v[i];
    f >> M;
    for(int i = 1; i <= M; i++)
    {
        f >> y;
        f >> x;
        //
        if(y == 0)
        {
            int k, kmax = -1, nr = 0;
            int s = 1, d = N, m;
            bool ok = 0;
            while(s <= d && ok == 0)
            {
                m = (s + d) / 2;
                if(x == v[m])
                    nr++;
                else
                    if(x < v[m])
                        d = m - 1;
                    else
                        if(x > v[m])
                            s = m + 1;
            }
            g << v[nr] << '\n';

            /// sau ///
            while(s <= d && ok == 0)
            {
                m = (s + d) / 2;
                if(x == v[m])
                {
                    ok = 1;
                    k = m;
                    if(k > kmax)
                        kmax = k;
                    if(v[kmax] == v[k + 1])
                    {
                        g << kmax + 1 << '\n';
                        break;
                    }
                }
                else
                    if(x < v[m])
                        d = m - 1;
                    else
                        s = m + 1;
            }
            if(ok == 1 && v[kmax] != v[k + 1])
                g << kmax << '\n';
            else
                if(ok == 0)
                    g << -1 << '\n';
            }


            //
            if(y == 1)
            {
                g << -1 << '\n';
            }
            //
            if(y == 2)
                g << -1 << '\n';
        }
    }

    **/