#include <fstream>
using namespace std;
int v[100010];

int bsearch0(int p, int u, int key){
    int m;
    while(p<=u) {
        m=(p+u)/2;
        if(v[m] <= key)
            p=m+1;
        else
            u = m-1;
    }
    m=(p+u)/2;
    if(v[m]>key)
        m--;
    if(v[m]==key)
        return m;
    return -1;
}
int bsearch1(int p,int u, int key){
    int m, n=u;
    while(p<u) {
        m=(p+u)/2;
        if(v[m]<=key){
            p=m+1;
        }
        else
        {
            u=m;
        }
    }
    m=(p+u)/2;
    if(v[m]>key)
        --m;
    return m;
}

int bsearch2(int p, int u, int key){
    int m;
    while(p<u){
        m=(p+u)/2;
        if(v[m] < key)
            p = m+1;
        else
        {
            u=m;
        }
    }
    m=(p+u)/2;
    if(v[m] < key)
        ++m;
    return m;

}

int main()
{
    int i,n,m,j;
    ifstream f("cautbin.in");
    ofstream g("cautbin.out");
    f >> n;
    for(i=1;i<=n;i++)
        f>>v[i];
    f >> m;
    for(i=0;i<m;i++)
    {
        int option, x;
        f >> option >> x;
        if(option==0) {
            g << bsearch0(1,n,x) << '\n';
        }
        else if(option==1) {
            g << bsearch1(1,n,x) << '\n';
        }
        else if(option==2) {
            g << bsearch2(1,n,x) << '\n';
        }
    }
    f.close();
    g.close();
}