#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int v[100005], i, n, m, q, x;
int main()
{   
    ifstream f("cautbin.in");
    ofstream g("cautbin.out");
    f >> n;
    for (i = 1; i <= n; i++)
        f >> v[i];
    f >> m;
    for (i = 1; i <= m; i++)
    {
        f >> q >> x;
        if (q == 0)
        {
            if (binary_search(v + 1, v + n + 1, x))
            {
                g << lower_bound(v + 1, v + n + 1, x + 1) - v - 1 << "\n";
            }
            else g << "-1\n";
        }
        if (q == 1)g << lower_bound(v + 1, v + n + 1, x + 1) - v - 1 << "\n";
        if (q == 2)g << upper_bound(v + 1, v + n + 1, x - 1) - v << "\n";
    }
    return 0;
}