#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> a(100000);

int main() {
    ifstream cin("cautbin.in");
    ofstream cout("cautbin.out");
    int n, m, op, x;
    cin>>n;
    for (int i=0; i < n; i++) {
        cin>>a[i];
    }
    sort(a.begin(), a.end());
    cin>>m;
    for (int i = 0; i < m; i++) {
        cin>>op>>x;
        int v = -1;
        if (op == 0) {
            v = upper_bound(a.begin(), a.begin()+n+1, x) - a.begin()-1;
            if (a[v] != x) {
                v = -1;
            }
        } else if (op == 1) {
            v = lower_bound(a.begin(), a.begin()+n+1, x+1)-a.begin()-1;
        } else {
            v = upper_bound(a.begin(), a.begin()+n+1, x-1)-a.begin();
        }
        if ( v > -1) {
            cout << v + 1 << endl;
        } else {
            cout << -1 << endl;
        }
    }
    return 0;
}