#include <fstream>

using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int N, v[100001];
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;
            p = m + 1;
        }
        else
            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, t, x;
    f >> N;
    for(int i = 1; i <= N; i++)
        f >> v[i];
    f >> M;
    while(M--)
    {
        f >> t >> x;
        if(t == 0)
            g << caut0(x) << '\n';
        else
            if(t == 1)
                g << caut1(x) << '\n';
            else
                g << caut2(x) << '\n';
    }
    return 0;
}