#include <cstdio>
    int N, M, v[100005], task, value, log2N, step, i;
int main()
{


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

    scanf("%d", &N);

    for(i = 1; i <= N; ++i)
    {
        scanf("%d", &v[i]);
    }

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

    scanf("%d", &M);

    for(; M; --M)
    {
        scanf("%d %d", &task, &value);

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

            printf("%d\n", i);
        }
    }

    return 0;
}