#include <iostream>
#include <cstdio>
using namespace std;
const int NMAX=100000;
int n,v[NMAX+5],L=16;

int caut1(int x)
{
    int r,pas;
    r=0;
    pas=1<<L;
    while(pas!=0)
    {
        if(r+pas<=n&&v[r+pas]<=x)
            r+=pas;
        pas=pas/2;
    }
    return r;
}

int caut2(int x)
{
    int r,pas;
    r=0;
    pas=1<<L;
    while(pas!=0)
    {
        if(r+pas<=n&&v[r+pas]<x)
            r+=pas;
        pas=pas/2;
    }
    r++;
    return r;
}
int caut0(int x)
{
    int gasit=-1;
    int dreapta=n,stanga=1,mijloc;
    while(stanga<=dreapta&&gasit==-1)
    {
        mijloc=(stanga+dreapta)/2;
        if(v[mijloc]==x)
        {
            while(v[mijloc]==x)
                mijloc++;
            gasit=mijloc-1;
        }
        if(v[mijloc]<x)
            dreapta=mijloc-1;
        if(v[mijloc]>x)
            stanga=mijloc+1;
    }
    return gasit;
}
int main()
{
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    cin>>n;
    int i;
    for(i=1;i<=n;i++)
        cin>>v[i];
    int m,cerinta,x;
    cin>>m;
    for(i=1;i<=m;i++)
    {
        cin>>cerinta>>x;
        if(cerinta==0)
            cout<<caut0(x)<<endl;
        if(cerinta==1)
            cout<<caut1(x)<<endl;
        if(cerinta==2)
            cout<<caut2(x)<<endl;
    }

}