#include <bits/stdc++.h>
#define MAX_N 100000

using namespace std;

ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

int cb0(int n, int arr[], int x) {
    int lo = 0, hi = n - 1;
    while (lo <= hi) {
        int mid = (lo + hi) / 2;
        if (arr[mid] <= x)
            lo = mid + 1;
        else
            hi = mid - 1;
    }

    return (arr[hi] == x ? hi : -1);
}

int cb1(int n, int arr[], int x) {
    int lo = 0, hi = n - 1;
    while (lo <= hi) {
        int mid = (lo + hi) / 2;
        if (arr[mid] <= x)
            lo = mid + 1;
        else
            hi = mid - 1;
    }

    return hi;
}

int cb2(int n, int arr[], int x) {
    int lo = 0, hi = n - 1;
    while (lo <= hi) {
        int mid = (lo + hi) / 2;
        if (arr[mid] >= x)
            hi = mid - 1;
        else
            lo = mid + 1;
    }

    return lo;
}

int main() {
    int n, m, arr[MAX_N];
    fin >> n;
    for (int i = 0; i < n; i++)
        fin >> arr[i];
    fin >> m;
    for (int i = 0; i < m; i++) {
        int t, x;
        fin >> t >> x;
        switch (t) {
            case 0:
                fout << cb0(n, arr, x) + 1 << '\n';
                break;
            case 1:
                fout << cb1(n, arr, x) + 1 << '\n';
                break;
            case 2:
                fout << cb2(n, arr, x) + 1 << '\n';
                break;
        }
    }
    return 0;
}