#include<iostream>
#include<fstream>
using namespace std;
int n,x,v[100000],m,k,tip,val;
int caut0 (int st, int dr,int x)
{
    while(st<=dr)
    {
        m=(st+dr)/2;
        if(v[m]<=x)
        st=m+1;
        else
        dr=m-1;
    }
    m=(st+dr)/2;
    if(v[m]>x)
    m--;
    if(v[m]==x)
    return m;
    return -1;
}
int caut1(int st, int dr, int x)
{
    while(st<dr)
    {
        m=(st+dr)/2;
        if(v[m]<=x)
        st=m+1;
        else
        dr=m;
    }
    m=(st+dr)/2;
    if(v[m]>x)
    m--;
    return m;
}
int caut2(int st, int dr,int x)
{
    while(st<dr)
    {
        m=(st+dr)/2;
        if(v[m]<x)
        st=m+1;
        else
        dr=m;
    }
    m=(st+dr)/2;
    if(v[m]<x)
    m++;
    return m;
}
int main()
{
    ifstream f("cautbin.in");
    ofstream g("cautbin.out");
    f>>n;
    for (int i=1;i<=n;i++)
        f>>v[i];
    f>>k;
    while(k--)
    {
        f>>tip>>val;
        if(tip==0) g<<caut0(1,n,val)<<endl;
        if(tip==1) g<<caut1(1,n,val)<<endl;
        if(tip==2) g<<caut2(1,n,val);
    }

    return 0;
}