#include <iostream>
#include <cstdio>
#define NMAX 100005

using namespace std;

int n, m, v[NMAX];

int solve0(int x, int biti)
{
    int sol = 0;
    for(int i=biti; i!=0; i>>=1)
        if(sol + i <= n && v[sol + i] <= x)
            sol += i;
    if(v[sol] == x)
        return sol;
    return -1;
}

int solve1(int x, int biti)
{
    int sol = 0;
    for(int i=biti; i!=0; i>>=1)
        if(sol + i <= n && v[sol + i] <= x)
            sol += i;
    return sol;
}

int solve2(int x, int biti)
{
    int sol = n;
    for(int i = biti; i!=0; i>>=1)
        if(sol - i > 0 && v[sol - i] >= x)
            sol -= i;
    return sol;
}

void read()
{
    scanf("%d", &n);
    for(int i=1; i<=n; ++i)
        scanf("%d", &v[i]);

    int biti;
    for(biti = 1; biti <= n; biti<<=1);

    scanf("%d", &m);
    for(int i=1; i<=m; ++i)
    {
        int operatie, x;
        scanf("%d %d", &operatie, &x);
        if(operatie == 0)
            printf("%d\n", solve0(x, biti));
        else if(operatie == 1)
            printf("%d\n",  solve1(x, biti));
        else
            printf("%d\n", solve2(x, biti));
    }
}

int main()
{
    freopen("cautbin.in", "r", stdin);
    freopen("cautbin.out", "w", stdout);
    read();
    return 0;
}