#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
const int maxn = 100005;
char T[maxn * 10];
int v[maxn];
int logn;
int n;
inline int cautbin_0(int x)
{
    int i, pas;
    for (pas = 1; pas < n; pas <<= 1);
    for (i = 0; pas; pas >>= 1)
        if (i + pas <= n && v[i + pas] <= x)
           i += pas;
    return i;
}

inline int cautbin_2(int x)
{
    int st = 1;
    int dr = n;
    int ret = -1;
    while(st <= dr)
    {
        int mij = st + (dr - st) / 2;
        if(x <= v[mij])
        {
            ret = mij;
            dr = mij - 1;
        }
        else
            st = mij + 1;
    }
    return ret;
}

void parsare()
{
    gets(T);
    gets(T);
    int sz = strlen(T);
    int nr = 0;
    int poz = 0;
    for(int i = 0; i < sz; i++)
    {
        if(T[i] == ' ')
        {
            v[++poz] = nr;
            nr = 0;
        }
        else
            nr = nr * 10 + T[i] - '0';
    }
    v[++poz] = nr;
}

int main()
{
    freopen("cautbin.in", "r", stdin);
    freopen("cautbin.out", "w", stdout);
    scanf("%d", &n);
    parsare();
    int m;
    scanf("%d", &m);
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        if(x == 0 || x == 1)
        {
            int sol = cautbin_0(y);
            if(x == 0 && v[sol] != y)
                printf("-1");
            else
                printf("%d", sol);
        }
        else
            printf("%d", cautbin_2(y));
        printf("\n");
    }
    return 0;
}