#include <bits/stdc++.h>

using namespace std;

int caut_bin(const vector<int> &v, const int x){
    int sure=0;
    for(int step = (2<<19); step>0; step/=2){
        const int candidat = step + sure;
        if(candidat < v.size() && v[candidat] <= x) sure=candidat; }
    return sure; }

int main()
{
    ifstream f("cautbin.in");
    ofstream g("cautbin.out");
    int n;
    f >> n;
    vector<int> v(n+1);
    for(int i=1; i<=n; ++i) f>>v[i]; ///citire vector
    v[0] = -1e9;

    int m, t, x;
    f >> m;
    for(int i=1; i<=m; ++i){
        f >> t >> x;
        if(t==1) g<< caut_bin(v, x) <<'\n';
        else if(t==2) g<< caut_bin(v, x-1)+1 <<'\n';
             else {
                const int temp = caut_bin(v, x);
                if(v[temp] == x) g<< temp <<'\n';
                else g << -1 << '\n';
                }
    }
    return 0;}