#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int nmax = 100005;

int n, i, m, op, x, poz, a[nmax];

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

    scanf("%d", &n);

    for(i = 1; i <= n; i++)
        scanf("%d", &a[i]);

    scanf("%d", &m);
    for(; m; m--)
    {
        scanf("%d%d", &op, &x);
        if(op == 0)
        {
            poz = upper_bound(a + 1, a + n + 1, x) - a;
            printf("%d\n", a[poz - 1] == x ? poz - 1 : -1);
        }
        else if(op == 1)
        {
            poz = upper_bound(a + 1, a + n + 1, x) - a;
            printf("%d\n", poz - 1);
        }
        else
        {
            poz = lower_bound(a + 1, a + n + 1, x) - a;
            printf("%d\n", poz);
        }
    }

    return 0;
}