#include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
using namespace std;
ll n,m,a[100005],x,t;
ll bin1(ll x,ll y){
    ll l,r;
    l=1;
    r=y;
    ll mid;
    while(l<r){
        mid=(l+r)/2;
        if(a[mid]<=x){
            l=mid+1;
        }else {
           r=mid;
        }
    }
    mid=(l+r)/2;
    if(a[mid]>x){
        mid--;
    }
    if(a[mid]==x)
    return mid;
    else return -1;
}
ll bin2(ll x,ll y){
    ll l,r,mid;
    l=1;
    r=y;
    while(l<r){
        mid=(l+r)/2;
        if(a[mid]<=x){
            l=mid+1;
        }else {
            r=mid;
        }
    }
    mid=(l+r)/2;
    if(a[mid]>x){
        mid--;
    }
    return mid;
}
ll bin3(ll x,ll y){
    ll l,r,mid;
    l=1;
    r=y;
    while(l<r){
        mid=(l+r)/2;
        if(a[mid]<x){
            l=mid+1;
        }else {
            r=mid;
        }
    }
    mid=(l+r)/2;
    if(a[mid]<x){
        mid++;
    }
    return mid;
}
int32_t main(){
CODE_START;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
cin>>n;
for(ll i=1;i<=n;i++)
cin>>a[i];
cin>>m;
while(m--){
    cin>>t>>x;
        if(t==0){
            cout<<bin1(x,n)<<endl;
        }else if(t==1){
            cout<<bin2(x,n)<<endl;
        }else if(t==2){
            cout<<bin3(x,n)<<endl;
        }
}
}