#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
const int maxn = 100005;
int v[maxn];
int n;

int cautbin0(int x)
{
    int st = 1;
    int dr = n;
    int rez = 0;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(v[mij] <= x)
        {
            rez = mij;
            st = mij + 1;
        }
        else
            dr = mij - 1;
    }
    if(v[rez] != x)
        return -1;
    return rez;
}

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

int cautbin2(int x)
{
    int st = 1;
    int dr = n;
    int rez = 0;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(v[mij] >= x)
        {
            rez = mij;
            dr = mij - 1;
        }
        else
            st = mij + 1;
    }
    return rez;
}

int main()
{
    in >> n;
    for(int i = 1; i <= n; i++)
        in >> v[i];
    int T;
    in >> T;
    for(int i = 1; i <= T; i++)
    {
        int op, x;
        in >> op >> x;
        if(op == 0)
            out << cautbin0(x);
        else if(op == 1)
            out << cautbin1(x);
        else
            out << cautbin2(x);
        out << "\n";
    }
    return 0;
}