#include<bits/stdc++.h>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
long long int a[1000001],N,M,x,y;
int main(){
    fin>>N;
    for(int i=1; i<=N; ++i)
        fin>>a[i];
    sort(a+1,a+N+1);
    fin>>M;
    for(int i=1; i<=M; ++i){
        fin>>x>>y;
        if(x==0){
            long long int* val2=upper_bound(a+1,a+N+1,y);
            auto val1= *lower_bound(a+1,a+N+1,y);
            if(val1==y)
                fout<<val2-a-1<<"\n";
            else
                fout<<-1<<"\n";
        }
        if(x==1){
            long long int* val2=upper_bound(a+1,a+N+1,y);
            fout<<val2-a-1<<"\n";
        }
        if(x==2){
            long long int* val2=lower_bound(a+1,a+N+1,y);
            fout<<val2-a<<"\n";
        }
    }
}