#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

int n, v[100001], m;
int cautare(int x) {
    int st = 1, dr = n;
    while (st < dr) {
        int m = (st + dr) / 2;
        if (v[m] < x)
            st = m + 1;
        else
            dr = m;
    }
    return st;
}

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> v[i];
    fin >> m;
    for (int i = 1; i <= m; i++) {
        int q, x;
        fin >> q >> x;
        if (q == 0) {
            int l = cautare(x);
            if (v[l] == x) {
                while (l + 1 <= n && v[l + 1] == x)
                    l++;
                fout << l << '\n';
            }
            else
                fout << -1;
        }
        if (q == 1) {
            int l = cautare(x);
            if (v[l] == x) {
                while (v[l + 1] == x && l + 1 <= n) {
                    l++;
                }
            }
            else if (v[l] > x) {
                l--;
            }
            fout << l << '\n';
        }
        if (q == 2) {
            int l = cautare(x);
            if (v[l] < x) {
                l++;
            }
            fout << l << '\n';
        }
    }
    return 0;
}