#include <iostream>
#include <fstream>
#define N 1000100
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[N];

int problema0 (int p, int u, int val)
{
    int m;

    while (p <= u)
    {
        m = (p + u) / 2;
        if (v[m] <= val)
            p = m + 1;
        else
            u = m - 1;
    }
    m = (p + u) / 2;

    if (v[m] > val)
        m --;
    if (v[m] == val)
        return m;
    return -1;
}

int problema1 (int p, int u, int val)
{
    int m;

    while (p < u)
    {
        m = (p + u) / 2;
        if (v[m] <= val)
            p = m + 1;
        else
            u = m;
    }

    m = (p + u) / 2;
    if (v[m] > val)
        -- m;
    return m;
}

int problema2 (int p, int u, int val)
{
    int m;

    while (p < u)
    {
        m = (p + u) / 2;
        if (v[m] < val)
            p = m + 1;
        else
            u = m;
    }

    m = (p + u) / 2;
    if (v[m] < val)
        ++ m;
    return m;
}

int main ()
{
    int i, n, m, tip, val;


    f>>n;
    for (i = 1; i <= n; i++)
        f>>v[i];

    f>>m;

    while (m >=1)
    {
        f>>tip>>val;
        if (tip == 0)
            g<<problema0(1, n, val)<<'\n';
        if (tip == 1)
            g<<problema1(1, n, val)<<'\n';
        if (tip == 2)
            g<<problema2(1, n, val)<<'\n';
        m--;
    }
    exit(0);
}