#include <cstdio>

using namespace std;
int n,v[100000],i,x,m,ok;
int cautare0(int x)
{
    int st=0,dr=n-1,mij;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(v[mij]==x&&v[mij+1]>x) return mij;
        else if(v[mij]<x) dr=mij-1;
        else if(v[mij]>=x) st=mij+1;
    }
    return -1;
}
int cautare1(int x)
{
     int st=0,dr=n-1,mij;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(v[mij]<=x&&v[mij+1]>x) return mij;
        else if(v[mij]<=x) st=mij+1;
        else if(v[mij]>x) dr=mij-1;
    }
}
int cautare2(int x)
{
    int st=0,dr=n-1,mij;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        if(v[mij]>=x&&v[mij-1]<x) return mij;
        else if(v[mij]<x) st=mij+1;
        else if(v[mij]>=x) dr=mij-1;
    }
}
int main()
{
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
    scanf("%d",&n);
    for(i=0;i<n;i++) scanf("%d",&v[i]);
    scanf("%d",&m);
    for(i=0;i<m;i++)
    {
        scanf("%d%d",&ok,&x);
        if(ok==0) printf("%d\n",cautare0(x)+1);
        if(ok==1) printf("%d\n",cautare1(x)+1);
        if(ok==2) printf("%d\n",cautare2(x)+1);
    }
}