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

const int MAX_N = 100005;

int a[MAX_N];

int Exact(int x, int n) {
    int left = 1, right = n, best = -1;
    while (left <= right) {
        int middle = (left + right) / 2;
        if (a[middle] <= x) {
            if (a[middle] == x) {
                best = middle;
            }
            left = middle + 1;
        } else {
            right = middle - 1;
        }
    }
    return best;
}

int LowerBound(int x, int n) {
    int left = 1, right = n, best = -1;
    while (left <= right) {
        int middle = (left + right) / 2;
        if (a[middle] <= x) {
            best = middle;
            left = middle + 1;
        } else {
            right = middle - 1;
        }
    }
    return best;
}

int UpperBound(int x, int n) {
    int left = 1, right = n, best = -1;
    while (left <= right) {
        int middle = (left + right) / 2;
        if (a[middle] >= x) {
            best = middle;
            right = middle - 1;
        } else {
            left = middle + 1;
        }
    }
    return best;
}

int main() {
    ifstream cin("cautbin.in");
    ofstream cout("cautbin.out");
    int n, m;
    cin >> n;
    for (int i = 1; i <= n; ++ i) {
        cin >> a[i];
    }
    cin >> m;
    for (int i = 1; i <= m; ++ i) {
        int type, x;
        cin >> type >> x;
        if (type == 0) {
            cout << Exact(x, n) << "\n";
        } else if (type == 1) {
            cout << LowerBound(x, n) << "\n";
        } else {
            cout << UpperBound(x, n) << "\n";
        }
    }

    return 0;
}