#include <fstream>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <string.h>
#include <queue>
#include <math.h>
#include <set>
#include <stack>

#define min(a,b) ((a<b)?a:b)
#define max(a,b) ((a<b)?b:a)
#define abs(a) ((a<0)?-a:a)
#define REP(i,a,b) \
	for (int i=a; i<=b; i++)

#define INF 1000000000

using namespace std;

//#define TEST
#ifdef TEST
ifstream fin("input.txt");
ofstream fout("output.txt");
#else
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
#endif // TEST

#define MAXN 2000000001
#define pb push_back
#define mp make_pair
#define MOD 1000000007

typedef long long ll;
typedef pair<int,int> pp;

int n,m;
int a[100000];

int main()
{
    fin>>n;
    for (int i=0; i<n; i++)
        fin>>a[i];
    fin>>m;
    for (int i=0; i<m; i++)
    {
        int x,y;
        fin>>x>>y;
        if (x==0)
        {
            int t;
            t = upper_bound(a,a+n,y)-a;
            if (a[t-1]!=y)
                fout<<"-1";
            else fout<<t;
        } else if (x==1)
        {
            int t;
            t = upper_bound(a,a+n,y)-a;
            fout<<t;
        } else
        {
            int t;
            t = lower_bound(a,a+n,y)-a;
            fout<<t+1;
        }
        fout<<'\n';
    }

	return 0;
}