#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
#include <utility>
#include<iostream>
#include<queue>
#include<utility>
#include <stdio.h>
#define RRR ios_base::sync_with_stdio(false);cin.tie(0);
#define ll long long
#define int ll
#define pp pair<int,int>
using namespace std;
int ar[100001];
int n;

int bina(int x)
{
	int low = 1;
	int high = n;
	int m = -1;
	int mid;
	while (low < high)
	{
		
		 mid = low + high >> 1;
		if (ar[mid] > x)
			high = mid - 1;
		else
		{
			m = max(low,m);
			low = mid + 1;
		}
	}
	mid = low + high >> 1;
	if (ar[mid] == x)
		printf("%d\n",mid);
	else if (ar[mid-1] == x)
		printf("%d\n",mid-1);
	else printf("%d\n",-1);
	return m;
}

int binar(int x)
{
	int low = 1;
	int high = n;
	int mid;
	while (low < high)
	{
		mid = low + high >> 1;
		if (ar[mid] > x)
			high = mid;
		else low = mid + 1;
	}
	mid = low + high >> 1;
	if (ar[mid] > x)
		mid--;
	printf("%d\n",mid);
	return 0;
}

int binar2(int x)
{
	int low = 1;
	int high = n;
	int mid;
	while (low < high)
	{
		mid = low + high >> 1;
		if (ar[mid] < x)
			low = mid+1;
		else high = mid;
	}
	mid = low + high >> 1;
	if (ar[mid] < x)
		mid++;
	printf("%d\n",mid);
	return 0;
}

int32_t main()
{
	RRR
//						freopen("text.txt","r",stdin);
	freopen("cautbin.in","r",stdin);
	freopen("cautbin.out","w",stdout);
	cin >> n;
	
	for (int i=1;i<=n;i++)
	{
		int z;
		cin >> ar[i];
	}
	//cout << bina(3);
	int q;
	cin >> q;
	for (int i=0;i<q;i++)
	{
		int a;
		cin >> a;
		int x;
		cin >> x;
		if (a == 0)
		{
			bina(x);
		}
		else if (a == 1)
		{
			binar(x);
			
		}
		else if (a == 2)
		{
			binar2(x);
		}

	}
	return 0;
 
}