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

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

int v[100001], n;

short CautBin(int x)
{
    int st = 1, dr = n, m;
    while(st <= dr)
    {
        m = (st+dr)>>1;
        if(v[m] == x)
        {
            while(v[m] == x)
            {
                m++;
            }
            return m-1;
        }
        else if(v[m] < x)
        {
            st = m+1;
        }
        else if(v[m] > x)
        {
            dr = m-1;
        }
    }
    return -1;
}

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

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

    int m, x;
    short c;
    fin>>m;
    for(i=1; i<=m; i++)
    {
        fin>>c>>x;
        if(c == 0)
        {
            fout<<CautBin(x)<<'\n';
        }
        else if(c == 1)
        {
            fout<<upper_bound(v+1, v+n+1, x) - v - 1<<'\n';
        }
        else
        {
            fout<<lower_bound(v+1, v+n+1, x) - v<<'\n';
        }

    }

    return 0;
}