#include<stdio.h>
#define nMax 100010

int bin_search0(int left, int right, int value, int arr[]) {
	int mid;
	while (right - left >= 2) {
		mid = left + (right - left) / 2;
		if (arr[mid] == value) {
			while (arr[mid] == value) {
				mid++;
			}
			return mid - 1;
		}
		else if (arr[mid] < value)
			bin_search0(arr[mid], right, value, arr);
		else
			bin_search0(left, arr[mid], value, arr);
	}
	return -1;
}

int bin_search1(int left, int right, int value, int arr[]) {
	int mid;
	while (right - left >= 2) {
		mid = left + (right - left) / 2;
		if (arr[mid] == value) {
			while (arr[mid] == value) {
				mid++;
			}
			return mid-1;
		}
		else if (arr[mid] < value)
			bin_search1(arr[mid], right, value, arr);
		else
			bin_search1(left, arr[mid], value, arr);
	}
	return mid - 1;
}

int bin_search2(int left, int right, int value, int arr[]) {
	int mid;
	while (right - left >= 2) {
		mid = left + (right - left) / 2;
		if (arr[mid] == value) {
			while (arr[mid] == value) {
				mid--;
			}
			return mid+1;
		}
		else if (arr[mid] < value)
			bin_search2(arr[mid], right, value, arr);
		else
			bin_search2(left, arr[mid], value, arr);
	}
	return mid + 1;
}

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

	int n, m, tip, r, v, arr[nMax];
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &arr[i]);
	}

	scanf("%d", &m);

	while (m) {
		scanf("%d%d", &tip, &v);
		if (tip == 0) {
			r = bin_search0(1, n, v, arr);
			printf("%d\n", r);
		}
		if (tip == 1) {
			r = bin_search1(1, n, v, arr);
			printf("%d\n", r);
		}
		if (tip == 2) {
			r = bin_search2(1, n, v, arr);
			printf("%d\n", r);
		}
		m--;
	}

	return 0;
}