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

using namespace std;

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

void answer_0(vector<int> &elements, int number){
    vector<int>::iterator it = upper_bound(elements.begin(),elements.end(),number - 1);

    if(*it == number){
        out << (it - elements.begin() + 1) << endl;
        return;
    }
    else{
        out << "-1"<<endl;
        return;
    }
//    vector<int>::iterator it = upper_bound(elements.begin(),elements.end(),number - 1);
//    if(*it == number)
//    {
//        while( *it == number)
//            ++it;
//
//        out << (it - elements.begin()) << endl;
//        return;
//    }
//    out << "-1" << endl;
}
void answer_1(vector<int> &elements, int number){
    vector<int>::iterator it = lower_bound(elements.begin(),elements.end(),number + 1);

    while( *it <= number && it != elements.end()){
        ++it;
    }
    out << (it - elements.begin()) << endl;
}
void answer_2(vector<int> &elements, int number){
    vector<int>::iterator it = upper_bound(elements.begin(),elements.end(),number - 1);

    out << (it - elements.begin() + 1) << endl;
}
void answer(vector<int> &elements,int question,int number){
    if (question == 0) {
        answer_0(elements,number);
    } else if (question == 1) {
        answer_1(elements,number);
    } else {
        answer_2(elements,number);
    }
}

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;
}