#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

void answer(vector<int> &elements,int question,int number){
    bool isElement = binary_search(elements.begin(),elements.end(),number);
    vector<int>::iterator it = lower_bound(elements.begin(), elements.end(), number);
    vector<int>::iterator up_it = upper_bound(elements.begin(), elements.end(), number);

    if(question == 0){
        if(!isElement){
            out << "-1" <<endl;
            return;
        }
        else {
            if (*it == number) {
                while (*it == number) {
                    ++it;
                }
                out << (it - elements.begin()) <<endl;
            }
        }
    }
    else
        if(question == 1){
            while (*it <= number) {
                ++it;
            }
            out << ( it - elements.begin()) << endl;
        }
    else
        if(question == 2){
            while (*up_it >= number) {
                --up_it;
            }
            ++up_it;

            out << ( up_it - elements.begin() + 1) << endl;
        }
}

int main() {
    int n,m;
    int elem;
    int question;
    int number;
    vector<int> elements;

    in >> n;
    for(int i = 0; i < n; i++)
    {
        in >> elem;
        elements.push_back(elem);
    }

    in >> m;
    for(int i = 0; i < m; i++)
    {
        in >> question >> number;
        answer(elements,question,number);
    }


    return 0;
}