#include <cstdio>
#include <algorithm>

#define IN_BUFFER_SIZE 32768

__attribute__((always_inline)) int get_number()
{
    static char inBuffer[IN_BUFFER_SIZE];

    static int p = IN_BUFFER_SIZE - 0x1; int number = 0x0;

    while(inBuffer[p] < 0x30 || inBuffer[p] > 0x39)
    {
        ++p == IN_BUFFER_SIZE && (fread(inBuffer, 0x1, IN_BUFFER_SIZE, stdin), p = 0x0);
    }

    for(;;)
    {
        number = number * 0xA + inBuffer[p] - 0x30;

        ++p == IN_BUFFER_SIZE && (fread(inBuffer, 0x1, IN_BUFFER_SIZE, stdin), p = 0x0);

        if(inBuffer[p] < 0x30 || inBuffer[p] > 0x39) break;
    }

    return number;
}

char outBuffer[0xAAE60]; int p = ~0x0;

__attribute__((always_inline)) void put_number(int x)
{
    int digits = x > 0x1869F    ? 0x7 :
                 x > 0x270F     ? 0x6 :
                 x > 0x3E7      ? 0x5 :
                 x > 0x63       ? 0x4 :
                 x > 0x9        ? 0x3 : 0x2;

    for(int i = digits; --i; x /= 0xA)
    {
        outBuffer[p + i] = x % 0xA + 0x30;
    }

    outBuffer[p = p + digits] = 0xA;
}

int main()
{
    int N, M, v[100005], task, value, log2N, step, i;

    freopen("cautbin.in", "r", stdin);
    freopen("cautbin.out", "w", stdout);

    N = get_number();

    for(i = 1; i <= N; ++i)
    {
        v[i] = get_number();
    }

    asm("bsrl %1, %0" : "=r"(log2N) : "r"(N));

    M = get_number();

    for(; M; --M)
    {
        task = get_number();

        value = get_number();

        if(task < 2)
        {
            for(step = log2N, i = 0; step; step >>= 1)
            {
                if(i + step <= N && v[i + step] <= value)
                {
                    i += step;
                }
            }

            if(!task && v[i] != value)
            {
                outBuffer[++p] = '-'; outBuffer[++p] = '1'; outBuffer[++p] = '\n';
            }
            else
            {
                put_number(i);
            }
        }
        else
        {
            for(step = log2N, i = N; step; step >>= 1)
            {
                if(i - step > 0 && v[i - step] >= value)
                {
                    i -= step;
                }
            }

            put_number(i);
        }
    }

    fwrite(outBuffer, 1, p, stdout);

    return 0;
}