#include <fstream>
#include <algorithm>
#define Vec 100002
using namespace std;

ifstream f("cautbin.in");
ofstream g("cautbin.out");
int a[Vec],n,i,m,p,x,poz;
int main()
{
    f >> n;
    for(i = 1; i <= n; i++)
        f >> a[i];
    f >> m;
    sort(a+1,a+1+n);
    for(i = 1; i <= m; i++){
        f >> p >> x;
        if(p == 0){
            poz = upper_bound(a+1,a+1+n,x)-a-1;
            if(a[poz] != x) g<<-1<<"\n";
                else
                    g << poz<<"\n";
        }
        if(p == 1){
            poz = lower_bound(a+1,a+1+n,x+1)-a-1;
            g << poz<<"\n";
        }
        if(p == 2){
            poz = upper_bound(a+1,a+1+n,x-1)-a;
            g << poz<<"\n";
        }
    }

    return 0;
}