#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>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;

const string file = "cautbin";

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

const int INF = 0x3f3f3f3f; 

//#define ONLINE_JUDGE

int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fin(infile.c_str(), ios::in);
	fstream fout(outfile.c_str(), ios::out);
#endif	

    int N, M;
    fin >> N;
    vector<int> A(N);
    for(int i = 0; i < N; i++)
    {
        fin >> A[i];
    }
    sort(A.begin(), A.end());
    fin >> M;
    for(int i = 0; i < M; i++)
    {
        int op, x;
        fin >> op >> x;
        if(op == 0)
        {
            int p = upper_bound(A.begin(), A.end(), x) - A.begin();
            if(p == N || A[p - 1] != x)
            {
                fout << "-1\n";
            }
            else 
            {
                fout << p << "\n";
            }

        }
        else if(op == 1)
        {
            int p = lower_bound(A.begin(), A.end(), x + 1) - A.begin();
            fout << p << "\n";
        }
        else if(op == 2)
        {
            int p = upper_bound(A.begin(), A.end(), x - 1) - A.begin();
            fout << p + 1 << "\n";
        }
    }

#ifdef ONLINE_JUDGE
#else
    fout.close();
	fin.close();
#endif
}