#include <cstdio>
#include <cassert>
#include <algorithm>
using namespace std;

const int MAX_N = 100005;

int n, m;
int v[MAX_N];

int main() {
	freopen("cautbin.in", "r", stdin);
	freopen("cautbin.out", "w", stdout);

	scanf("%d", &n);
	for (int i = 0; i < n; ++i) {
		scanf("%d", &v[i]);
		if (i) assert(v[i] > v[i-1]);
	}

	for (scanf("%d", &m); m; --m) {
		int op, val, ans;
		scanf("%d %d", &op, &val);
		switch (op) {
			case 0: ans = upper_bound(v, v+n, val) - v - 1;
					printf("%d\n", v[ans] == val ? ans + 1 : -1);
					break;
			case 1: printf("%d\n", upper_bound(v, v+n, val) - v);
					break;
			case 2: printf("%d\n", lower_bound(v, v+n, val) - v + 1);
					break;
		}
	}
}