#include <fstream>

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

int BinarySearch0(int l, int r, int v, int a[]);
int BinarySearch1(int l, int r, int v, int a[]);
int BinarySearch2(int l, int r, int v, int a[]);

int main()
{
    int a[100001], N, v, M, x;
    fin >> N;
    for (int i = 1; i <= N; ++i)
        fin >> a[i];
    fin >> M;

    while (M--)
    {
        fin >> x >> v;
        if (x == 0)
            fout << BinarySearch0(1, N, v, a) << '\n';
        if (x == 1)
            fout << BinarySearch1(1, N, v, a) << '\n';
        if (x == 2)
            fout << BinarySearch2(1, N, v, a) << '\n';
    }
    fin.close();
    fout.close();

}

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

    return p;
}

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

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