#include <fstream>
using namespace std;
ifstream f ("cautbin.in");
ofstream g ("cautbin.out");
int A[100], N, K, intrebare, X;
void citeste (int a[], int &n, int &k)
{
    f >> n;
    for (int i = 1; i <= n; ++i) f >> a[i];
    f >> k;
}
int zerox (int a[], int n, int x)
{
    int st = 1, dr = n, m = 0, poz = -1;
    while (st <= dr)
    {
        m = (st + dr) / 2;
        if (x < a[m]) dr = m - 1;
        else
        {
            if (x == a[m]) poz = m;
            st = m + 1;
        }
    }
    return poz;
}
int unux (int a[], int n, int x)
{
    int st = 1, dr = n, m = 0, poz = -1;
    while (st <= dr)
    {
        m = (st + dr) / 2;
        if (a[m] <= x)
        {
            poz = m;
            st = m + 1;
        }
        else  dr = m - 1;
    }
    return poz;
}
int doix (int a[], int n, int x)
{
    int st = 1, dr = n, m = 0, poz = -1;
    while (st <= dr)
    {
        m = (st + dr) / 2;
        if (a[m] >= x)
        {
            poz = m;
            dr = m - 1;
        }
        else st = m +1;
    }
    return poz;
}
int main()
{
    citeste (A, N, K);
    for (int i = 1; i <= K; ++i)
    {
        f >> intrebare >> X;
        if (intrebare == 0)
        {
            g << zerox (A, N, X) << '\n';
        }
        else if (intrebare == 1)
        {
            g << unux (A, N, X) << '\n';
        }
        else if (intrebare == 2)
        {
            g << doix (A, N, X) << '\n';
        }
    }
    return 0;
}