#include <bits/stdc++.h>

using namespace std;

ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, a[100005], m;
int main()
{
    int i, op, x, p;
    fin >> n;
    for (i = 1; i <= n; i++)
        fin >> a[i];
    fin >> m;
    while (m--)
    {
        fin >> op >> x;
        switch (op)
        {
        case 0: 
        {
            p = binary_search(a + 1, a + n + 1, x);
            if (p) fout << p << "\n";
            else fout << "-1\n";
            break; 
        }
        case 1: 
        {   
            fout << upper_bound(a + 1, a + n + 1, x) - a - 1 << "\n";         
            break;
        }
        case 2: 
        {   
            fout << lower_bound(a + 1, a + n + 1, x) - a << "\n";
            break; 
        }
        }
    }


    return 0;
}