#include <fstream>

using namespace std;

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

const int L = 16;
const int DimMax = 1e5;

int v[DimMax],n,m,q,t;

int BinarySearch1(int x)
{
    int r=0,pas;
    pas=1<<L;
    while(pas!=0)
    {
        if(r+pas<=n && v[r+pas]<=x)
        {
            r+=pas;
        }
        pas/=2;
    }
    if(v[r]!=x)
    {
        r-=1;
    }
    return r;
}

int BinarySearch2(int x)
{
    int r=0,pas;
    pas=1<<L;
    while(pas!=0)
    {
        if(r+pas<=n && v[r+pas]<=x)
        {
            r+=pas;
        }
        pas/=2;
    }
    return r;
}

int BinarySearch3(int x)
{
    int r=0,pas;
    pas=1<<L;
    while(pas!=0)
    {
        if(r+pas<=n && v[r+pas]<x)
        {
            r+=pas;
        }
        pas/=2;
    }
    r++;
    return r;
}

int main()
{
    in >> n;
    for (int i = 1; i <= n; ++i)
        in >> v[i];
    in >> m;
    while (m--)
    {
        in >> q >> t;
        if (q == 0)
            out << BinarySearch1(t)<<endl;
        if (q == 1)
            out <<BinarySearch2(t)<<endl;
        if (q == 2)
            out << BinarySearch3(t)<<endl;
    }
    return 0;
}