/******************************************************************************

Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debug online from anywhere in world.

*******************************************************************************/
#include <iostream>
#include <fstream>

using namespace std;

int v[1000005];

int n;

int cautareBinaraCerUnu(int deGasit){
    int start=1,end=n;
    bool ok = 1;
    int mijloc;
    while(start < end){
        mijloc = (start+end)/2;
        if(v[mijloc] < deGasit){
            start = mijloc + 1;
        }else if(v[mijloc] > deGasit){
            end = mijloc - 1;
        }else{
            ok = 0; break;
        }
    }
    if(ok == 1) return -1;
    
    while(v[mijloc] == deGasit){
        mijloc++;
    }
    
    return mijloc-1;
}
int cautareBinaraCerDoi(int deGasit){
    int start=1,end=n;
    bool ok = 1;
    int mijloc;
    while(start < end){
        mijloc = (start+end)/2;
        if(v[mijloc] < deGasit){
            start = mijloc + 1;
        }else if(v[mijloc] > deGasit){
            end = mijloc - 1;
        }else{
            ok = 0; break;
        }
    }
    mijloc = (start+end)/2;
    while(v[mijloc] > deGasit){
        mijloc--;
    }
    
    return mijloc+1;
}
int cautareBinaraCerTrei(int deGasit){
    int start=1,end=n;
    bool ok = 1;
    int mijloc;
    while(start < end){
        mijloc = (start+end)/2;
        if(v[mijloc] < deGasit){
            start = mijloc + 1;
        }else if(v[mijloc] > deGasit){
            end = mijloc - 1;
        }else{
            ok = 0; break;
        }
    }
    mijloc = (start+end)/2;
    while(v[mijloc] < deGasit){
        mijloc++;
    }
    
    return mijloc-1;
}


int main()
{
    ifstream cin("cautbin.in");
    ofstream cout("cautbin.out");
    
    int m,tip,val;
    
    cin >> n;
    
    for(int i = 1; i <= n; i++){
        cin >> v[i];
    }
    
    cin >> m;
    
    for(int i = 0; i < m; i++){
        cin >> tip >> val;
        
        if(tip == 0){
            cout << cautareBinaraCerUnu(val) << endl;
        }else if(tip == 1){
            cout << cautareBinaraCerDoi(val) << endl;
        }else if(tip == 2){
            cout << cautareBinaraCerTrei(val) << endl;
        }
    }

    return 0;
}