#include <fstream>

using namespace std;

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

int v[100001], log[100001];

int cautbin (int key, int n)
{
    int best = 0;
    for (int i = log[n]; i >= 0; --i )
        if ( best + (1<<i) <= n && v[best+(1<<i)] <= key )
            best += (1<<i);
    return best;
}

int main()
{
    int n, m;
    fin>>n;
    for ( int i = 1; i <= n; ++i )
        fin>>v[i];
    for ( int i = 2; i <= n; ++i )
        log[i] = log[i/2] + 1;
    fin>>m;
    while ( m-- )
    {
        int tip, key;
        fin>>tip>>key;
        if ( tip == 0 )
        {
            if ( v[cautbin(key, n)] == key )
                fout<<cautbin(key, n)<<'\n';
            else
                fout<<"-1"<<'\n';
        }
        if ( tip == 1 )
        {
            fout<<cautbin(key, n)<<'\n';
        }
        if ( tip == 2 )
        {
            fout<<cautbin(key-1, n)+1<<'\n';
        }
    }
}