#include <iostream>
#include <fstream>
#define NMAX 200000
using namespace std;

ifstream f("cautbin.in");
ofstream g("cautbin.out");

int n, v[NMAX];

int max_pos(int st, int dr, int val) {

    if (st > dr) return -2;
    if (st == dr) {
        if (val == v[st]) return st;
        return -2;
    }

    int mij = (st + dr) / 2;
    if (v[mij] > val) {
        return max_pos(st, mij - 1, val);
    } else if (v[mij] == val) {
        return max(max_pos(mij + 1, dr, val), mij);
    } else {
        return max_pos(mij + 1, dr, val);
    }

}

int max_pos1(int st, int dr, int val) {

    if (st > dr) return -2;
    if (st == dr) {
        if (val >= v[st]) return st;
        return -2;
    }

    int mij = (st + dr) / 2;
    if (v[mij] > val) {
        return max_pos1(st, mij - 1, val);
    } else if (v[mij] <= val) {
        return max(max_pos1(mij + 1, dr, val), mij);
    }

}

int max_pos2(int st, int dr, int val) {

    if (st > dr) return 1e9;
    if (st == dr) {
        if (val <= v[st]) return st;
        return -1;
    }

    int mij = (st + dr) / 2;
    if (val <= v[mij]) {
        return min(mij, max_pos2(st, mij - 1, val));
    }
    return max_pos2(mij + 1, dr, val);

}

int main() {

    f >> n;
    for (int i = 0; i < n; ++i) {
        f >> v[i];
    }

    int query_number;
    f >> query_number;
    while (query_number--) {
        int x, y;
        f >> x >> y;
        if (x == 0) {
            g << max_pos(0, n - 1, y) + 1 << "\n";
        }
        if (x == 1) {
            g << max_pos1(0, n - 1, y) + 1 << "\n";
        }
        if (x == 2) {
            g << max_pos2(0, n - 1, y) + 1 << "\n";
        }
    }

    return 0;
}