#include <fstream>
using namespace std;
int v[100001], n, i, t, c, p;
int cautbin1(int elem)
{
    int st = 1, dr = n, mij, p = -1;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(v[mij] == elem)
        {
            p = mij;
            st = mij + 1;
        }
        else if(v[mij] > elem) dr = mij - 1;
        else st = mij + 1;
    }
    return p;
}
int cautbin2(int elem)
{
    int st = 1, dr = n, mij;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(v[mij] > elem) dr = mij - 1;
        else st = mij + 1;
    }
    return dr;
}
int cautbin3(int elem)
{
    int st = 1, dr = n, mij;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(v[mij] < elem) st = mij + 1;
        else dr = mij - 1;
    }
    return st;
}
int main()
{
    ifstream f("cautbin.in");
    ofstream g("cautbin.out");
    f >> n;
    for(i = 1; i <= n; ++ i)
        f >> v[i];
    f >> t;
    while(t --)
    {
        f >> c >> p;
        if(c == 0) g << cautbin1(p) << "\n";
        else if(c == 1) g << cautbin2(p) << "\n";
        else g << cautbin3(p) << "\n";
    }
    return 0;
}