#include <bits/stdc++.h>
using namespace std;
int v[100001], i, t, n, x, y;
int cautbin0(int elem)
{
    int st = 1, dr = n, mij, poz = -1;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(v[mij] == elem)
        {
            poz = mij;
            st = mij + 1;
        }
        else if(v[mij] >= elem) dr = mij - 1;
                           else st = mij + 1;
    }
    return poz;
}
int cautbin2(int elem) // cea mai mica pozitie
{
    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 cautbin1(int elem) // cea mai mare pozitie
{
    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 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 >> x >> y;
        if(x == 0) g << cautbin0(y) << "\n";
        else if(x == 1) g << cautbin1(y) << "\n";
        else g << cautbin2(y) << "\n";
    }
    f.close();
    g.close();
    return 0;
}