#include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long
#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
using namespace std;
ll n,a[100000],m,t,x,mid;
ll bin0(ll l,ll r,ll x){
while(l<=r){
        mid=(l+r)/2;
if(a[mid]<=x){
    l=mid+1;
}else {
r=mid-1;
}
}
mid=(l+r)/2;
if(a[mid]>x){
    mid--;
}
if(a[mid]==x){
    return mid;
}else return -1;
}
ll bin1(ll l,ll r,ll x){
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 bin2(ll l,ll r,ll x){
    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;
}
int main(){
ifstream cin ("cautbin.in");
ofstream cout ("cautbin.out");
cin>>n;
for(ll i=0;i<n;i++)
    cin>>a[i];
    cin>>m;
    for(ll i=0;i<m;i++)
    {
        cin>>t;
        cin>>x;
        if(t==0){
            cout<<bin0(0,n-1,x)+1<<'\n';
        }else if(t==1){
        cout<<bin1(0,n-1,x)+1<<'\n';
        }else if(t==2){
        cout<<bin2(0,n-1,x)+1<<'\n';
        }
    }
}