#include<stdio.h>
#include<algorithm>
using namespace std;
int a[100001],n,i,j,x,y,t,m;
int main()
{
	freopen("cautbin.in","r",stdin);
	freopen("cautbin.out","w",stdout);
	scanf("%d",&n);

	for(i=1;i<=n;i++)
		scanf("%d",&a[i]);
	scanf("%d",&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d %d",&t,&x);
		if(t==0)
			{
					y=upper_bound(a,a+n+1,x)-a-1;
				 if (y<=n&&y>=1&&a[y]==x)
					printf("%d\n",y);
				else
					printf("-1\n");
			}
		else 
		if (t == 1) {
            y = lower_bound(a,a+n+1,x+1)-a-1;
            printf("%d\n", y);
        } else {
            y = upper_bound(a,a+n+1,x-1)-a;
            printf("%d\n", y);

		}
	}
	return 0;}