#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef double ld;

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

int n, m;
vi v;


int binary_search(vi v, int x) {
    int pos = -1;
    int left = 0, right = v.size() - 1;
    while (left <= right) {
        int middle = left + (right - left) / 2;
        if (v[middle] == x && v[middle + 1] != x) {
            pos = middle;
            break;
        } else if (v[middle] >= x) {
            left = middle + 1;
        } else {
            right = middle - 1;
        }
    }

    return pos;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    fin >> n;

    for (int i = 0; i < n; i++) {
        int x;
        fin >> x;
        v.pb(x);
    }

    fin >> m;

    for (int i = 0; i < m; i++) {
        int op, x;
        fin >> op >> x;
        if (op == 0) {
            fout << binary_search(v, x) + 1 << "\n";
        } else if (op == 1) {
            fout << upper_bound(v.begin(), v.end(), x) - v.begin() << "\n";
        } else {
            fout << lower_bound(v.begin(), v.end(), x) - v.begin() + 1 << "\n";
        }
    }
    
    return 0;
}