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

vector<int> a;

int binMaxEq(int value) {
    int left = 0, right = a.size()-1;
    while (left+1 < right) {
        int middle = (left + right)/2;
        if (a[middle]<=value) {
            left = middle;
        } else {
            right = middle;
        }
    }
    if (value == a[right]) {
        return right;
    }
    if (value == a[left]) {
        return left;
    }
    return -1;
}

int binMaxEqLt(int value) {
    int left = 0, right = a.size()-1;
    while (left+1 < right) {
        int middle = (left + right)/2;
        if (a[middle]<=value) {
            left = middle;
        } else {
            right = middle;
        }
    }
    if (value >= a[right]) {
        return right;
    }
    return left;
}

int binMaxEqGt(int value) {
    int left = 0, right = a.size()-1;
    while (left+1 < right) {
        int middle = (left + right)/2;
        if (a[middle]<value) {
            left = middle;
        } else {
            right = middle;
        }
    }
    if (value <= a[left]) {
        return left;
    }
    return right;
}

int main() {
    ifstream cin("cautbin.in");
    ofstream cout("cautbin.out");
    int n, m, x, op;

    cin>>n;
    for (int i=0; i < n; i++) {
        cin>>x;
        a.push_back(x);
    }
    sort(a.begin(), a.end());
    cin>>m;
    for (int i = 0; i < m; i++) {
        cin>>op>>x;
        if (op == 0) {
            cout << binMaxEq(x)+1 << endl;
        } else if (op == 1) {
            cout << binMaxEqLt(x)+1 << endl;
        } else {
            cout << binMaxEqGt(x)+1 << endl;
        }
    }
    return 0;
}