#include <iostream>

#define NMAX 100005

// modified upper bound
int bsearch0(int *arr, int n, int v)
{
    int l, r, m;
    
    l = 0;
    r = n;

    while (l < r) {
        m = l + ((r - l) >> 1);

        if (arr[m] <= v)
            l = m + 1;
        else
            r = m;
    }

    if (l > 0 && arr[l - 1] == v)
        return l - 1;

    return -1;
}

// upper bound
int bsearch1(int *arr, int n, int v)
{
    int l, r, m;
    
    l = 0;
    r = n;

    while (l < r) {
        m = l + ((r - l) >> 1);

        if (arr[m] <= v)
            l = m + 1;
        else
            r = m;
    }

    return l;
}

// lower bound
int bsearch2(int *arr, int n, int v)
{
    int l, r, m;
    
    l = 0;
    r = n;

    while (l < r) {
        m = l + ((r - l) >> 1);

        if (arr[m] < v)
            l = m + 1;
        else
            r = m;
    }

    return l;
}


int main()
{
    int n, m;
    int arr[NMAX];

    freopen("cautbin.in", "r", stdin);
    freopen("cautbin.out", "w", stdout);

    std::cin >> n;

    for (int i = 0; i < n; ++i)
        std::cin >> arr[i];

    std::cin >> m;

    for (int q, v, p, i = 0; i < m; ++i)
    {
        std::cin >> q >> v;

        switch (q) {
        case 0:
            p = bsearch0(arr, n, v);

            std::cout << (p == -1 ? -1 : p + 1) << '\n';
            break;
        case 1:
            std::cout << bsearch1(arr, n, v) << "\n"; // (p - 1) + 1
            break;
        case 2:
            std::cout << bsearch2(arr, n, v) + 1 << "\n";
            break;
        }
    }

    return 0;
}