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

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

const int nmax = 1e5+5;
int v[nmax], n;

int bsearch0(int val)
{
    int st=1, dr=n, mij;
    while(st<=dr)
    {
        mij=(st+dr)>>1;
        if(v[mij] <= val) st=mij+1;
        else dr=mij-1;
    }
    if(v[dr]!=val) return -1;
    return dr;
}

int bsearch1(int val)
{
    int st=1, dr=n, mij;
    while(st<=dr)
    {
        mij=(st+dr)>>1;
        if(v[mij]<=val) st=mij+1;
        else dr=mij-1;
    }
    return dr;
}

int bsearch2(int val)
{
    int st=1, dr=n, mij;
    while(st<=dr)
    {
        mij=(st+dr)>>1;
        if(v[mij] < val) st=mij+1;
        else dr=mij-1;
    }
    return st;
}

int main()
{
    ios_base::sync_with_stdio(false);
    int m, op, val, i;
    fin >> n;
    for(i=1; i<=n; i++)
        fin >> v[i];
    fin >> m;
    for(i=1; i<=m; i++)
    {
        fin >> op >> val;
        if(op==0) fout << bsearch0(val) << "\n";
        else if(op==1) fout << bsearch1(val) << "\n";
        else fout << bsearch2(val) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}