#include <stdio.h>
#include <stdlib.h>
#define N 100010
int v[N];

int bsearch0 (int p, int u, int key)
{
    int m;

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

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

int bsearch1 (int p, int u, int key)
{
    int m;

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

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

int bsearch2 (int p, int u, int key)
{
    int m;

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

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

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

    FILE* f= fopen("cautbin.in","r");
    FILE *g= fopen("cautbin.out","w");
    fscanf(f,"%d", &n);
    for (i = 1; i <= n; ++ i)
        fscanf(f,"%d", &v[i]);

    fscanf(f,"%d", &m);

    while (m --)
    {
        fscanf(f,"%d%d", &tip, &val);
        if (tip == 0)
            fprintf(g,"%d\n", bsearch0(1, n, val));
        if (tip == 1)
            fprintf(g,"%d\n", bsearch1(1, n, val));
        if (tip == 2)
            fprintf(g,"%d\n", bsearch2(1, n, val));
    }
}