#include <bits/stdc++.h>
#define ll long long
#define sz size
#define pb push_back
#define er erase
#define in insert
#define fr first
#define sc second
#define mp make_pair
#define pi pair
#define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
#define rc(s) return cout<<s,0
const int mod=1e9+7;
const int inf=1e5;
using namespace std;
std::multiset<int>::iterator it;
std::multiset<int>::iterator it1;

long long a[100005];
int n,t,m;
long long x;

int binsearch0(long long x){
     int l=1;
     int r=n;
     while(r>=l){
     int mid=l+(r-l)/2;
     if(a[mid]==x && (a[mid+1]>x || mid+1>n)) return mid;
     if(a[mid]<=x){l=mid+1; continue;}
     if(a[mid]>x){ r=mid-1; continue;}
     }
     return -1;
}

int binsearch1(long long x){
    int l=1;
    int r=n;
    while(r>=l){
        int mid=l+(r-l)/2;
        if(a[mid]<=x && (a[mid+1]>x || mid+1==n+1) ) return mid;
        if(a[mid]>x){r=mid-1; continue;}
        if(a[mid]<=x){l=mid+1; continue;}
    }

}

int binsearch2(long long x){
    int l=1;
    int r=n;
    while(r>=l){
        int mid=l+(r-l)/2;
        if(a[mid]>=x && (a[mid-1]<x || mid-1==0)) return mid;
        if(a[mid]>=x){r=mid-1; continue;}
        if(a[mid]<x){l=mid+1; continue;}
    }


}

int main(){ _
    ifstream fin ("cautbin.in");
    ofstream fout("cautbin.out");
    fin >> n;
    for(int i=1;i<=n;i++) fin >> a[i];
    fin >> m;
    for(int i=1;i<=m;i++){
        fin >> t;
        if(t==0){fin >> x; fout<<binsearch0(x)<<endl;  continue; }
        if(t==1){fin >> x; fout<<binsearch1(x)<<endl; continue; }
        if(t==2){fin >> x; fout<<binsearch2(x)<<endl; continue; }
    }
}