#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair<ll, ll>
#define sz(x) (int)((x).size())
#define all(a) (a).begin(), (a).end()

/* int f[maxn],nf[maxn],inv[maxn];
const int M=998244353;
void init(){
    inv[1]=1; for (int i=2;i<maxn;i++) inv[i]=M-1ll*(M/i)*inv[M%i]%M;
    f[0]=nf[0]=1; for (int i=1;i<maxn;i++) f[i]=1ll*f[i-1]*i%M,nf[i]=1ll*nf[i-1]*inv[i]%M;
}
int C(int x,int y){return 1ll*f[x]*nf[y]%M*nf[x-y]%M;}*/
const ll mod = 1e9+7;
ll n, k, m, mi, ma;

void solve(){
	
	ifstream cin("cautbin.in");
	ofstream cout("cautbin.out");
	
	cin >> n;
	vector<ll> a(n);
	for(int i = 0; i<n; i++) cin >> a[i];
	cin >> m;
	ll c, x;
	for(int i = 0; i<m; i++){
		cin >> c >> x;
		if(c == 0){
			ll l = 0, r = n - 1, j;
			ma = -2;
			while(l <= r){
				j = (l + r)/2;
				if(a[j] < x){
					l = j + 1;
					continue;
				}
				if(a[j] > x){
					r = j - 1;
					continue;
				}	
				ma = max(ma, j);
				l = j + 1;
			}
			cout << ma + 1 << "\n";
			continue;
		}
		if(c == 1){
			ll l = 0, j, r = n - 1;
			ma = -2;
			while(l <= r){
				j = (l + r)/2;
				if(a[j] > x){
					r = j - 1;
					continue;
				}
				ma = max(ma, j);
				l = j + 1;
			}
			cout << ma + 1 << "\n";
			continue;
		}
		ll l = 0, j, r = n - 1;
		mi = n + 5;
		while(l <= r){
			j = (l + r)/2;
			if(a[j] < x){
				l = j + 1;
				continue;
			}
			mi = min(mi, j);
			r = j - 1;
		}
		cout << mi + 1 << "\n";
	}
	
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t=1;
//	cin >> t;
	while(t--) solve();
	
	return 0;
}