#include <fstream>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout("cautbin.out");
int v[100001], n, m, op, val;
int steps = 1;
int BS1(int x)
{
    int pos=1;
    for(int i = steps; i > 0; i/=2)
    {
        if(pos+i <=n && v[pos+i] <=x)
        {
            pos =pos+i;
        }
    }
    return pos;
}
int BS0(int x)
{
    int pos = BS1(x);
    if(v[pos] == x)
        return pos;
    else
        return -1;
}
int BS2(int x)
{
    int pos = n;
    for(int i = steps; i  >0; i/=2)
    {
        if(v[pos-i] >= x && pos-i >= 1)
        {
            pos = pos-i;
        }
    }
    return pos;
}
int main() {
    fin >> n;
    for(int i = 1;i <= n; ++i)
    {
        fin >> v[i];
    }
    while(steps < n)
    {
        steps = steps*2;
    }
    fin >> m;
    for(int i = 0; i < m; ++i)
    {
        fin >> op;
        fin >> val;
        if(op == 0)
            fout<<BS0(val)<<'\n';
        else if(op == 1)
            fout<<BS1(val)<<'\n';
        else
            fout<<BS2(val)<<'\n';
    }
    return 0;
}