#include <bits/stdc++.h>
using namespace std;
int a[999999];
int n,nr,m,t,x;
void cit()
{
    freopen("cautbin.in","r",stdin);
    freopen("cautbin.out","w",stdout);
}

int bins(int x)
{
    int st=1,dr=n,m;
    while(st<=dr)
    {
        m=st/2+dr/2;
        if(a[m]<x)st=m+1;
        else if(a[m]>x) dr=m-1;
        else
        {
            while(a[m]==x) m++;
            return m-1;
        }
    }
    return -1;
}
int main()
{
    cit();
    scanf("%d",&n);

    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);

    scanf("%d",&m);

    for(int j=1;j<=m;j++){
        scanf("%d %d",&t,&x);

        if(t==2)
            printf("%d\n",lower_bound(a+1,a+n+1,x)-a);
        else if(t==1)
            printf("%d\n",upper_bound(a+1,a+n+1,x)-a-1);
        else{
            printf("%d\n",bins(x));
        }


    }
    return 0;



}