#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
#include <string>
#include <iterator>
#include <numeric>
#include <string>
#include <set>
#include <map>
#include <queue>

using namespace std;

ifstream in("cautbin.in");
ofstream out("cautbin.out");

int main()
{
    int N, M;
    in >> N;

    vector<int> numbers(N);
    copy_n(istream_iterator<int>(in), N, numbers.begin());

    sort(numbers.begin(), numbers.end());

    in >> M;
    while(M--)
    {
        int operation, value;
        in >> operation >> value;

        if(operation == 0)
        {
            auto ub = upper_bound(numbers.begin(), numbers.end(), value);

            if(ub == numbers.begin() || *(ub - 1) != value)
                out << -1;
            else
                out << ub - numbers.begin();
        }
        else if(operation == 2)
        {
            auto lb = lower_bound(numbers.begin(), numbers.end(), value);
            out << lb - numbers.begin() + 1;
        }
        else
        {
            auto ub = upper_bound(numbers.begin(), numbers.end(), value);
            out << ub - numbers.begin();
        }
        out << '\n';
    }

    return 0;
}