#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#define ll long long
using namespace std;

ifstream cin("cautbin.in");
ofstream cout("cautbin.out");

const int NMAX = 1e5;
int n, m;
int a[NMAX + 1];

int CautBin(int value)
{
    int st = 1, dr = n, poz = 0;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(a[mij] <= value)
            poz = mij, st = mij + 1;
        else
            dr = mij - 1;
    }
    return poz;
}

int CautBin2(int value)
{
    int st = 1, dr = n, poz = 0;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(a[mij] >= value)
            poz = mij, dr = mij - 1;
        else
            st = mij + 1;
    }
    return poz;
}

int main()
{
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> a[i];

    cin >> m;
    while(m--)
    {
        int tip, x;
        cin >> tip >> x;
        if(tip == 0)
        {
            int poz = CautBin(x);
            if(a[poz] == x)
                cout << poz << '\n';
            else
                cout << -1 << '\n';
        }
        else if(tip == 1)
            cout << CautBin(x) << '\n';
        else
            cout << CautBin2(x) << '\n';
    }
    return 0;
}