#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;
#define MAX_N 100002

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]);
	scanf("%d", &m);
	for (int i = 0; i < m; ++i)
	{
		int x, y;scanf("%d%d", &x, &y);
		if (x == 0)
		{
			int low = lower_bound(v, v+n, y) - v;
			if (v[low] == y) printf("%d\n", low + 1);
			else printf("-1\n");
		}
		if (x == 1)
			printf("%d\n", upper_bound(v, v+n, y) - v);
		if (x == 2)
			printf("%d\n", lower_bound(v, v+n, y) - v + 1);
	}
}