#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define ll long long
#define input "cautbin.in", "rt", stdin
#define output "cautbin.out", "wt", stdout
#define all(a) a.begin(), a.end()
using namespace std;

const int nMax = 1e5;

int n, x, m;
vector <int> a;

int solve(short int p)
{
    if (p == 0)
    {
        int sol = upper_bound(all(a), x) - a.begin();
        return (a[sol - 1] == x ? sol : -1);
    }
    if (p == 1)
    {
        int sol = lower_bound(all(a), x + 1) - a.begin();
        return sol;
    }
    return upper_bound(all(a), x - 1) - a.begin() + 1;
}

main()
{
    freopen(input);
    freopen(output);
    cin >> n;
    for (int i = 1; i <= n; ++i)
    {
        int x; cin >> x; a.emplace_back(x);
    }
    cin >> m;
    for (; m; --m)
    {
        short int p;
        cin >> p >> x;
        cout << solve(p) << "\n";
    }
}