#include<bits/stdc++.h>
#include <fstream>
 
using namespace std;
 
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
 
int n, m;
int v[100002], x, tip;
 
int main()
{
 
 
    fin >> n;
    for(int i = 1; i <= n; ++i)
        fin >> v[i];
 
    sort(v+1, v+n+1);
 
    fin >> m;
    for(int i = 1; i <= m; ++i)
    {
        fin >> tip >> x;
        if(tip == 0){
 
 
            int st = 1;
            int dr = n;
            int ok = -1;
            while(st <= dr)
            {
                int mij = (st + dr) / 2;
                if(v[mij] <= x) {
                    st = mij + 1;
                    if(v[mij] == x){
                        ok = mij;
                    }
                }
                else
                    dr = mij - 1;
            }
            fout << ok << "\n";
        }
 
        if (tip == 1){
 
            int st = 1;
            int dr = n;
            int ok = 0;
            while(st <= dr)
            {
                int mij = (st + dr) / 2;
                if(v[mij] <= x) {
                    st = mij + 1;
                    ok = mij;
                }
                else
                    dr = mij - 1;
            }
            fout << ok << "\n";
        }
 
        if (tip == 2) {
 
 
            int st = 1;
            int dr = n;
            int ok = 0;
            while(st <= dr)
            {
                int mij = (st + dr) / 2;
                if(v[mij] < x) {
                    st = mij + 1;
                }
                else
                {
					ok = mij;
                    dr = mij - 1;
                }
            }
            fout << ok << "\n";
    }
 
        }
 
 
    return 0;
}