#include <fstream>
#include <algorithm>

using namespace std;

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

int n, v[100005], m, x, y;

int main() {
    fin >> n;
    for(int i = 1; i <= n; i++) {
        fin >> v[i];
    }
    fin >> m;
    for(int i = 1; i <= m; i++) {
        fin >> x >> y;
        if(x == 0) {
            int ind = upper_bound(v + 1, v + n + 1, y) - v - 1;
            if(ind <= n && ind >= 1 && v[ind] == y) {
                fout << ind << "\n";
            } else {
                fout << "-1\n";
            }
        } else if(x == 1) {
            int ind = lower_bound(v + 1, v + n + 1, y + 1) - v - 1;
            fout << ind << "\n";
        } else if(x == 2) {
            int ind = upper_bound(v + 1, v + n + 1, y - 1) - v;
            fout << ind << "\n";
        }
    }
    fin.close();
    fout.close();
    return 0;
}