#include <bits/stdc++.h>

using namespace std;

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

int n, bin;
vector <int> v;

int bin_search0(int value) {
    int l = 1, r = n, m;

    while (l <= r) {
        m = (l + r) >> 1;
        if (v[m] <= value) {
            l = m | 1;
        } else {
            r = m - 1;
        }
    }

    m = (l + r) >> 1;
    if (v[m] > value) {
        --m;
    }

    return (v[m] == value) ? m : -1;

}

int bin_search1(int value) {
    int m, l = 1, r = n;

    while (l < r) {
        m = (l + r) >> 1;
        if (v[m] <= value) {
            l = m | 1;
        } else {
            r = m;
        }
    }

    m = (l + r) >> 1;
    if (v[m] > value) {
        --m;
    }

    return m;
}

int bin_search2(int value) {
    int m, l = 1, r = n;

    while (l < r) {
        m = (l + r) >> 1;
        if (v[m] < value) {
            l = m + 1;
        } else {
            r = m;
        }
    }

    m = (l + r) >> 1;
    if (v[m] < value) {
        ++m;
    }

    return m;
}

int main() {
    fin >> n;
    v.resize(n + 1);

    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
    }

    fin >> bin;
    while (bin--) {
        int type, value;
        fin >> type >> value;

        if (type == 0) {
            fout << bin_search0(value) << '\n';
        } else if (type == 1) {
            fout << bin_search1(value) << '\n';
        } else {
            fout << bin_search2(value) << '\n';
        }
    }

    return 0;
}