#include <iostream>
#include <fstream>
using namespace std;
const int maxn = 100005;
int v[maxn];
int n;

int cautbin1(int x)
{
    int st = 1;
    int dr = n;
    int raspuns = -1;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(v[mij] <= x)
        {
            raspuns = mij;
            st = mij + 1;
        }
        else
            dr = mij - 1;
    }
    return raspuns;
}

int cautbin2(int x)
{
    int st = 1;
    int dr = n;
    int raspuns = -1;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(v[mij] >= x)
        {
            raspuns = mij;
            dr = mij - 1;
        }
        else
            st = mij + 1;
    }
    return raspuns;
}

int main()
{
    ifstream cin("cautbin.in");
    ofstream cout("cautbin.out");
    int m;
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> v[i];
    cin >> m;
    for(int i = 1; i <= m; i++)
    {
        int op, x;
        cin >> op >> x;
        if(op == 0)
        {
            int rasp = cautbin1(x);
            if(rasp == -1)
                cout << -1;
            else if(v[rasp] != x)
                cout << -1;
            else
                cout << rasp;
        }
        else if(op == 1)
            cout << cautbin1(x);
        else
            cout << cautbin2(x);
        cout << "\n";
    }
    return 0;
}