#include <fstream>
#include <algorithm>

using namespace std;

int n;
int a[100005];

int main()
{
    ifstream f("cautbin.in");
    ofstream g("cautbin.out");
    f >> n;
    for(int i = 1; i <= n; i ++) f >> a[i];
    sort(a + 1, a + n + 1);
    int m, op, x; f >> m;
    int l, r;
    for(; m; m --) {
        f >> op >> x;
        if(op == 0) {
            for(l = 1, r = n; l <= r;) {
                int mid = (r - l) / 2 + l;
                if(a[mid] > x) r = mid - 1;
                else l = mid + 1;
            }
            if(a[l - 1] == x) g << l - 1 << "\n";
            else g << "-1\n";
        }
        else if(op == 1) {
            for(l = 1, r = n; l <= r;) {
                int mid = (r - l) / 2 + l;
                if(a[mid] > x) r = mid - 1;
                else l = mid + 1;
            }
            g << l - 1 << "\n";
        }
        else if(op == 2) {
            x --;
            for(l = 1, r = n; l <= r;) {
                int mid = (r - l) / 2 + l;
                if(a[mid] > x) r = mid - 1;
                else l = mid + 1;
            }
            g << l << "\n";
        }
    }
    return 0;
}