#include<fstream>
#include<algorithm>
using namespace std;
const int Nmax=100001;
int n,m,a,b,v[Nmax],i,j;
int cautbin(int val)
{
    int step=1;
    
    for(;step<n;step<<=1);
    
    int start =0;
    for(;step;step>>=1)
    {
    int index=start+step;
    if(index>=n) continue;
    if(v[index]<=val)
    start=index;
    }
    return start;
}
int main()
{
    ifstream fin("cautbin.in");
    ofstream fout("cautbin.out");
 
    fin>>n;
 
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
    }
 
    fin>>m;
 
    for(j=1;j<=m;j++)
    {
        fin>>a;
        fin>>b;
 
        if(a==0)
        {
            int s=cautbin(b);
 
            if(v[s]==b)
                fout<<s<<"\n";
            else
                fout<<"-1"<<"\n";
        }
        if(a==1)
        {
            fout<<cautbin(b)<<"\n";
        }
        if(a==2)
        {
            fout<<cautbin(b-1)+1<<"\n";
        }
    }
}