#include <fstream>

using namespace std;

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

int n, m;
int a[100001];

int search(int x)
{
    int st = 1;
    int dr = n;
    while (st <= dr)
    {
        int mij = (st + dr) / 2;
        if (x == a[mij])
        {
            while (x == a[mij])
                mij++;
            return mij-1;
        }
        if (x < a[mij])
        {
            dr = mij - 1;
        }
        else
        {
            st = mij + 1;
        }
    }
    return -1;
}

int search2(int x)
{
    int st = 1;
    int dr = n;
    int nr=0;
    int mij = -1;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        if (x < a[mij])
        {
            dr = mij - 1;
        }
        else
        {
            st = mij + 1;
            nr = mij;
        }
    }
    return nr;
}

int search3(int x)
{
    int st = 1;
    int dr = n;
    int nr = 0;
    int mij = -1;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        if (x <= a[mij])
        {
            dr = mij - 1;
            nr = mij;
        }
        else
        {
            st = mij + 1;
        }
    }
    return nr;
}


int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
    {
        fin >> a[i];
    }
    fin >> m;
    int c,x;
    for (int i = 1; i <= m; i++)
    {
        fin >> c >> x;
        if (c == 0)
        {
            fout<<search(x)<<"\n";
        }
        if (c == 1)
        {
            fout << search2(x) << "\n";
        }
        if (c == 2)
        {
            fout << search3(x) << "\n";
        }
    }
    return 0;
}