#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
const int NMAX = 1e5 + 1;
int n, m, a[NMAX];

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
        fin >> a[i];
    fin >> m;
    while(m--)
    {
        int op, val;
        fin >> op >> val;
        if(op == 0)
        {
            int poz = upper_bound(a + 1, a + n + 1, val) - a - 1;
            fout << (1 <= poz && poz <= n && a[poz] == val ? poz : -1) << "\n";
        }
        else if(op == 1)
            fout << lower_bound(a + 1, a + n + 1, val + 1) - a - 1 << "\n";
        else
            fout << upper_bound(a + 1, a + n + 1, val - 1) - a << "\n";
    }

    return 0;
}