#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int n, v[101], t, y, m;
    cin >> n;
    for (int i =1; i <= n; ++i) {
        cin >> v[i];
    }
    sort(v + 1, v + n + 1);
    cin >> m;
    for (int i = 1; i <= m; ++i) {
        cin >> t >> y;
        if (t == 0) {
            int x = upper_bound(v + 1, v + n + 1, y) - v - 1;
            if (x <= n && x >= 1 && v[x] == y) {
                cout << x << "\n";
            } else {
                cout << "-1\n";
            }
        } else if (t == 1) {
            int x = lower_bound(v + 1, v + n+ 1, y + 1) - v - 1;
            cout << x << "\n";
        } else {
            int x = upper_bound(v + 1, v + n + 1, y - 1) - v;
            cout << x << "\n";
        }
    }
}