#include <fstream>
using namespace std;

ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

int v[100010], n;

int CautareBinara(int x)
{
    int s = 1, d = n, poz;
    bool gasit = 0;
    while(s <= d && gasit == 0)
    {
        int mij = (s + d) / 2;
        if(v[mij] == x)
        {
            gasit = 1;
            poz = mij;
        }
        else
        {
            if(x < v[mij])
            {
                d = mij - 1;
            }
            else
            {
                s = mij + 1;
            }
        }
    }
    if(gasit)
    {
        return poz;
    }
    return -1;
}

int bsearch1 (int p, int u, int key) {
    int m;

    while (p < u){
        m = (p + u) / 2;
        if (v[m] <= key)
            p = m + 1;
        else
            u = m;
    }

    m = (p + u) / 2;
    if (v[m] > key)
       -- m;
    return m;
}

int bsearch2 (int p, int u, int key) {
    int m;

    while (p < u) {
        m = (p + u) / 2;
        if (v[m] < key)
            p = m + 1;
        else
            u = m;
    }

    m = (p + u) / 2;
    if (v[m] < key)
       ++ m;
    return m;
}

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
    {
        fin >> v[i];
    }
    int m, intrebare, nr_intrebare;
    fin >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> intrebare >> nr_intrebare;
        switch(intrebare)
        {
        case 0:
        {
            int p = CautareBinara(nr_intrebare);
            if(p == -1)
            {
                fout << -1 << '\n';
            }
            else
            {
                while(v[p + 1] == nr_intrebare && p < n)
                {
                    p++;
                }
                fout << p << '\n';
            }
        }
        break;
        case 1:
            fout << bsearch1(1, n, nr_intrebare) << '\n';
            break;
        case 2:
            fout << bsearch2(1, n, nr_intrebare) << '\n';
            break;
        }
    }

    return 0;
}