//https://www.nerdarena.ro/problema/cautbin

//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("fast-math")
//#pragma GCC optimize ("unroll-loops")
//#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
//#include <iostream>
//#include <fstream>
#include <vector>
//#include <cstring>
//#include <cmath>
//#include <bitset>
//#include <queue>
//#include <stack>
//#include <utility>
#include <algorithm>
//#include <string>
//#include <map>
//#include <unordered_map>
//#include <set>
//#include <unordered_set>
//#include <cstdint>
//#include <climits>
//#include <iomanip>
//#include <cstdio>
//#include <tuple>

using namespace std;

const int NRMAX = 100000;

int main()
{
	//ios_base::sync_with_stdio(false);
	//cin.tie(NULL);

	FILE* fin = fopen("cautbin.in", "r");
	FILE* fout = fopen("cautbin.out", "w");

	int n, m, i, t, nr;
	vector<int> v(NRMAX);

	fscanf(fin, "%d", &n);
	for (i = 0; i < n; ++i)
		fscanf(fin, "%d", &v[i]);

	fscanf(fin, "%d", &m);
	for (i = 0; i < m; ++i)
	{
		fscanf(fin, "%d %d", &t, &nr);

		if (t == 0)
		{
			int rez = upper_bound(v.begin(), v.begin() + n, nr) - v.begin() - 1;
			fprintf(fout, (v[rez] == nr) ? "%d\n" : "-1\n", rez + 1);
		}
		else if (t == 1)
		{
			int rez = upper_bound(v.begin(), v.begin() + n, nr) - v.begin();
			fprintf(fout, "%d\n", rez);
			
		}
		else //if (t == 2)
		{
			int rez = lower_bound(v.begin(), v.begin() + n, nr) - v.begin() + 1;
			fprintf(fout, "%d\n", rez);
		}
	}

	return 0;
}