#include <stdio.h>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
using namespace std;
#define FOR(i,a,b) for (typeof a i=a;i<=b;i++)
#define fori(it,v) for (typeof ((v).begin()) it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
FILE *in,*out;
vector<int>a;
int n,m,x,y;
vector<int>::iterator t;
int main()
{
	in=fopen("cautbin.in","r");
	out=fopen("cautbin.out","w");
	fscanf(in,"%d",&n);
	a.reserve(n);
	FOR(i,1,n)
	{
		fscanf(in,"%d",&x);
		a.pb(x);
	}
	fscanf(in,"%d",&m);
	FOR(i,1,m)
	{
		fscanf(in,"%d%d",&x,&y);
		if (x==0)
		{
			t=upper_bound(all(a),y);
			if (*(t-1)==y)
				fprintf(out,"%d\n",(int)(t-a.begin()));
			else
				fprintf(out,"-1\n");;
		}
		if (x==1)
		{
			t=lower_bound(all(a),y);
			if (*t!=y)
				t--;
			fprintf(out,"%d\n",(int)(t-a.begin()+1));
		}
		if (x==2)
		{
			t=upper_bound(all(a),y);
			if (*(t-1)==y)
				t--;
			fprintf(out,"%d\n",(int)(t-a.begin()+1));
		}
	}
	fclose(in);
	fclose(out);
	return 0;

}