#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
using namespace std;

const string file = "cautbin";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;

int N, M;
vector<int> A;


int caut1(int x)
{
	int st = 0;
	int dr = N - 1;
	while(st < dr)
	{
		int mid = (st + dr)/2;

		if(A[mid] <= x)
		{
			st = mid + 1;
		}
		else
		{
			dr = mid - 1;
		}
	}
	int mid = (st + dr)/2;
	if(A[mid] > x)
		mid --;
	if(A[mid] == x)
		return mid + 1;
	return -1;
}


int caut2(int x)
{
	int st = 0;
	int dr = N - 1;
	while(st < dr)
	{
		int mid = (st + dr)/2;

		if(A[mid] <= x)
		{
			st = mid + 1;
		}
		else
		{
			dr = mid;
		}
	}
	int mid = (st + dr)/2;

	if(A[mid] > x)
		mid --;
	return mid + 1;
}

int caut3(int x)
{
	int st = 0;
	int dr = N - 1;
	while(st < dr)
	{
		int mid = (st + dr)/2;

		if(A[mid] < x)
		{
			st = mid + 1;
		}
		else
		{
			dr = mid;
		}
	}
	int mid = (st + dr)/2;
	if(A[mid] < x)
		mid++;
	return mid + 1;
}


int main()
{
	fstream fout(outfile.c_str(), ios::out);
	fstream fin(infile.c_str(), ios::in);
	fin >> N;
	A.resize(N);
	for(int i = 0; i < N; i++)
	{
		fin >> A[i];
	}
	fin >> M;
	for(int i = 0; i < M; i++)
	{
		int op, x;
		fin >> op >> x;

		if(op == 0)
		{
			fout << caut1(x) << "\n";
		}
		else if(op == 1)
		{
			fout << caut2(x) << "\n";
		}
		else if(op == 2)
		{
			fout << caut3(x) << "\n";
		}
	}
	fin.close();
	fout.close();
}