#include <cstdio>
#include <algorithm>
#include <vector>
#define print(int) fprintf(g,"%d\n",x);
FILE *f=fopen("cautbin.in","r");
FILE *g=fopen("cautbin.out","w");
using namespace std;
vector <int> v;
vector <int>::iterator it;
bool cmp(int x,int y){return x<y;}
int main()
{
    int n,m,x,op,val;
    fscanf(f,"%d",&n);
    for(int i=1;i<=n;i++){fscanf(f,"%d",&x);v.push_back(x);}
    fscanf(f,"%d",&m);
    sort(v.begin(),v.end());
    for(int i=1;i<=m;i++)
    {
        fscanf(f,"%d%d",&op,&val);
        if(op==0)
        {
            x=(upper_bound(v.begin(),v.end(),val)-v.begin());
            if(v[x-1]!=val)fprintf(g,"-1\n");
            else print(x);
        }
        else if(op==1)
        {x=(upper_bound(v.begin(),v.end(),val)-v.begin());print(x);}
        else if(op==2)
        {
            x=(lower_bound(v.begin(),v.end(),val)-v.begin());
            if(v[x]==val)x++;
            if(v[x-1]<val)x++;
            print(x);
        }
    }
    return 0;
}