#include <fstream>

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

int v, n, a[100000], M, x, p;
int Search(int l, int r, int v);
int Search1(int l, int r, int v);
int Search2(int l, int r, int v);
void Read();

int main()
{
    Read();
    while (M--)
    {
        fin >> x >> p;
        if (x == 0)
            fout << Search(1, n, p) << '\n';
        if (x == 1)
            fout << Search1(1, n, p) << '\n';
        if (x == 2)
            fout << Search2(1, n, p) << '\n';
    }
}

void Read()
{
    fin >> n;
    for (int i = 1; i <= n; ++i)
        fin >> a[i];
    fin >> M;
}

int Search(int l, int r, int v)
{
    int m, poz{-1};
    while (l <= r)
    {
        m = (l + r) / 2;
        if (a[m] <= v)
            l = m + 1;
        else
            r = m - 1;
        if (a[m] == v)
            poz = m;
    }
    return poz;
}

int Search1(int l, int r, int v)
{
    int m, poz{-1};
    while (l <= r)
    {
        m = (l + r) / 2;
        if (a[m] <= v)
            l = m + 1, poz = m;
        else
            r = m - 1;
    }
    return poz;
}

int Search2(int l, int r, int v)
{
    int m, poz{-1};
    while (l <= r)
    {
        m = (l + r) / 2;
        if (a[m] >= v)
            r = m - 1, poz = m;
        else
            l = m + 1;
    }
    return poz;
}