#include <bits/stdc++.h>
using namespace std;

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

int n, Q;
int a[100005];

int Query1(int val)
{
    int st, dr, mij, P;
    st = 1; dr = n; P = -1;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        if (a[mij] == val) P = mij;
        if (a[mij] <= val) st = mij + 1;
        else dr = mij - 1;
    }
    return P;
}
int Query2(int val)
{
    int st, dr, mij, P;
    st = 1; dr = n; P = -1;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        if (a[mij] <= val)
        {
            P = mij;
            st = mij + 1;
        }
        else dr = mij - 1;
    }
    return P;
}
int Query3(int val)
{
    int st, dr, mij, P;
    st = 1; dr = n; P = -1;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        if (a[mij] >= val)
        {
            P = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }
    return P;
}

int main()
{
    int op, x;
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> a[i];
    fin >> Q;
    while (Q--)
    {
        fin >> op >> x;
        if (op == 0) fout << Query1(x) << "\n";
        if (op == 1) fout << Query2(x) << "\n";
        if (op == 2) fout << Query3(x) << "\n";
    }
    return 0;
}