#include <iostream>
#include <fstream>
using namespace std;

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

int n, a[100005], ans1, ans2, ans3;

int BinSearch0(int x)
{
    int st, dr, nr, mij;
    st = 1;
    dr = n;
    nr = -1;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(a[mij] <= x)
            {
                st = mij + 1;
                if(a[mij] == x) nr = mij;

            }
        else dr = mij - 1;
    }
    return nr;
}

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

int BinSearch2(int x)
{
    int st, dr, mij, nr;
    st = 1;
    dr = n;
    nr = -1;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(a[mij] >= x)
            {
                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];
    int m, x, y;
    fin >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> y >> x;
        if(y == 0) fout << BinSearch0(x) << "\n";
        else if(y == 1) fout << BinSearch1(x) << "\n";
        else fout << BinSearch2(x) << "\n";
    }
    return 0;
}