#include <fstream>
#include <algorithm>
using namespace std;

int n, k, i,nr,nrbun,v[100001],a,b,mij,q,d,st,dr;
bool ok;

ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

int main ()
{
    fin >> n;
    for(i = 1; i <= n; ++i)
        fin >> v[i];

    sort(v + 1, v + n + 1);

    fin >> q;
    for(i = 1; i <= q; ++i)
        {
            fin >> a >> b;
            switch(a)
            {
                case 0 :{
                            d = upper_bound(v + 1, v + n + 1, b) - v - 1;
                            if (d <= n && d >= 1 && v[d] == b)
                                fout << d << '\n';
                            else fout << -1 << '\n';
                            break;
                        }
                case 1: {
                            d = lower_bound(v + 1, v + n + 1, b+1) - v - 1;
                            fout << d << '\n';
                            break;
                        }
                case 2: {
                            d = upper_bound(v + 1, v + n + 1, b-1) - v;
                            fout << d << '\n';
                            break;
                        }
            }
        }

    return 0;
}