#include <bits/stdc++.h>
const int NMAX = 100005;
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

int n, m, v[NMAX], ok, sol;

int bs0(int val) {
    int p=1, i=0;
    while(p*2<=n)
        p=p<<1;
    while(p) {
        if(i+p<=n && v[i+p]<=val)
            i=i+p;
        p=p/2;
    }
    if(v[i]==val)
        return i;
    return -1;
}
int bs1(int val) {
    int p=1, i=0;
    while(p*2<=n)
        p=p<<1;
    while(p) {
        if(i+p<=n && v[i+p]<=val)
            i=i+p;
        p=p/2;
    }
    if(v[i]==val)
        return i;
    return i-1;

}
int bs2(int val) {
    int p=1, i=0;
    while(p*2<=n)
        p=p<<1;
    while(p) {
        if(i+p<=n && v[i+p]<val)
            i=i+p;
        p=p/2;
    }
    if(v[i]==val)
        return i;
    return i+1;
}
int main() {
    int i, q, x;
    fin>>n;
    for(i=1; i<=n; i++)
        fin>>v[i];
    fin>>m;
    for(i=1; i<=m; i++) {
        fin>>q>>x;
        if(q==0)
            fout<<bs0(x)<<'\n';
        if(q==1)
            fout<<bs1(x)<<'\n';
        if(q==2)
            fout<<bs2(x)<<'\n';
    }
    return 0;
}