#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");

const int nmax = 100005;
int v[nmax];

int main()
{
    ios_base::sync_with_stdio(false);
    int n, i, q, op, val, up, low;
    fin >> n;
    for(i=1; i<=n; i++)
        fin >> v[i];
    fin >> q;
    while(q--)
    {
        fin >> op >> val;
        if(op==0)
        {
            if(!binary_search(v+1, v+n+1, val)) fout << "-1\n";
            else fout << upper_bound(v+1, v+n+1, val)-v-1 << "\n";
        }
        else if(op==1) fout << upper_bound(v+1, v+n+1, val)-v-1 << "\n";
        else if(op==2) fout << lower_bound(v+1, v+n+1, val)-v << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}