#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <list>
#include <bitset>
#include <ctime>
#include <cassert>
#include <iomanip>

using namespace std;

const string file = "cautbin";
const string inputF = file + ".in";
const string outputF = file + ".out";

const double epsilon = 1e-7;

#define LL long long
#define ULL unsigned long long 
#define MOD1 666013
#define MOD2 666019
#define MOD3 1999999973
#define base 73

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> ii;
typedef pair<long long, long long> ll;
typedef vector<ii> vii;
typedef vector<ll> vll;

#define all(V) V.begin(), V.end()
#define allr(V) V.rbegin(), V.rend()
#define for_c_it(container, it) for (auto it : container)
#define present(container, element) (container.find(element) != container.end()) 
#define sz(a) int((a).size()) 
#define pb push_back 
#define mp make_pair
#define zeroes(x) ((x ^ (x - 1)) & x)

int N, M;
vi V;

int main() {
#ifndef INFOARENA
	freopen("input.txt", "r", stdin);
#else 
	freopen(inputF.c_str(), "r", stdin);
	freopen(outputF.c_str(), "w", stdout);
#endif

	int i, pw, t, x;
	scanf("%d", &N);
	V.resize(N);
	for (int i = 0; i < N; ++i) {
		scanf("%d", &V[i]);
	}
	
	for (pw = 1; pw <= N; pw <<= 1);
	pw >>= 1;
	//cout << pw
	scanf("%d", &M);
	for (i = 0; i < M; ++i) {
		scanf("%d %d", &t, &x); 
		
		if (t < 2) {
			int poz = 0;
			for (int step = pw; step; step >>= 1) {
				if (poz + step - 1 < N) {
					if (V[poz + step - 1] <= x) {
					 poz += step - 1;
					}
				}
			}
			if (t == 0 && V[poz] != x) {
				printf("-1\n");
			}
			else {
				printf("%d\n", poz + 1);
			}
		}
		else {
			int poz = N - 1;
			for (int step = pw; step; step >>= 1) {
				if (poz - step - 1 >= 0) {
					if (V[poz - step - 1] >= x) {
					 poz = poz - step - 1;
					}
				}
			}
			printf("%d\n", poz + 1);
		}
	}

	return 0;
}