#include <bits/stdc++.h>

using namespace std;

#if 1
    #define pv(x) std::cerr<<#x<<" = "<<(x)<<"; ";std::cerr.flush()
    #define pn std::cerr<<std::endl
#else
    #define pv(x)
    #define pn
#endif

#ifdef INFOARENA
    ifstream in("cautbin.in");
    ofstream out("cautbin.out");
#else
    #define in cin
    #define out cout
#endif

using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pld = pair<ld, ld>;
#define pb push_back
const double PI = 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862;
const int inf_int = 1e9 + 5;
const ll inf_ll = 1e18 + 5;
const int NMax = 1e5 + 5;
const int dx[] = {-1,0,0,+1}, dy[] = {0,-1,+1,0};
const double EPS = 1e-8;

int v[NMax];

int bin1(int target, int N) {
    int st = 1, dr = N;

    while ((dr - st + 1) > 2) {
        int mid = st + (dr - st) / 2;

        if (v[mid] <= target) {
            st = mid;
        }
        else {
            dr = mid - 1;
        }
    }

    if (v[dr] == target) {
        return dr;
    }
    if (v[st] == target) {
        return st;
    }
    return -1;
}

int bin2(int target, int N) {
    int st = 1, dr = N;

    while ((dr - st + 1) > 2) {
        int mid = st + (dr - st) / 2;

        if (v[mid] <= target) {
            st = mid;
        }
        else {
            dr = mid - 1;
        }
    }

    if (v[dr] <= target) {
        return dr;
    }
    if (v[st] <= target) {
        return st;
    }
    assert(false);
}

int bin3(int target, int N) {
    int st = 1, dr = N;

    while ((dr - st + 1) > 2) {
        int mid = st + (dr - st) / 2;

        if (v[mid] < target) {
            st = mid + 1;
        }
        else {
            dr = mid;
        }
    }

    if (v[st] >= target) {
        return st;
    }
    if (v[dr] >= target) {
        return dr;
    }
    assert(0);
}

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);

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

    int M;
    in >> M;
    while (M--) {
        int tip, val;
        in >> tip >> val;

        if (tip == 0) {
            out << bin1(val, N) << '\n';
        }
        else if (tip == 1) {
            out << bin2(val, N) << '\n';
        }
        else {
            out << bin3(val, N) << '\n';
        }
    }

    return 0;
}