#include <cstdio>
#include <algorithm>

#define BUFFER_SIZE 1400000

char buffer[BUFFER_SIZE]; int p = -1;

__attribute__((always_inline)) int get_number()
{
    int number = 0;

    for(++p; buffer[p] > 47; ++p)
    {
        number = number * 10 + buffer[p] - 48;
    }

    return number;
}

char outBuffer[700000], *writeHead = outBuffer;

__attribute__((always_inline)) void put_int(int x)
{
    if(x == 0)
    {
        *(writeHead++) = 48; *(writeHead++) = 10;

        return;
    }

    if(x < 0)
    {
        *(writeHead++) = 45; *(writeHead++) = 49; *(writeHead++) = 10;

        return;
    }

    char *old = writeHead;

    while(x)
    {
        *(writeHead++) = x % 10 + 48;

        x /= 10;
    }

    std::reverse(old, writeHead);

    *(writeHead++) = 10;
}


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

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

    fread(buffer, 1, BUFFER_SIZE, stdin);

    N = get_number();

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

    for(log2N = 1; log2N <= N; log2N <<= 1);

    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)
            {
                put_int(-1);
            }
            else
            {
                put_int(i);
            }
        }
        else
        {
            for(step = log2N, i = N; step; step >>= 1)
            {
                if(i - step > 0 && v[i - step] >= value)
                {
                    i -= step;
                }
            }

            put_int(i);
        }
    }

    fwrite(outBuffer, 1, writeHead - outBuffer, stdout);

    return 0;
}