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

using namespace std;

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

int n,m;

void answer_0(int *elements, int number){
    int* it = upper_bound(elements,elements + n,number - 1);

    if(*it == number){
        out << (it - elements + 1) << endl;
        return;
    }
    else{
        out << "-1"<<endl;
        return;
    }
}
void answer_1(int *elements, int number){
    int* it = lower_bound(elements,elements + n,number + 1);

    out << (it - elements) << endl;
}
void answer_2(int *elements, int number){
    int *it = upper_bound(elements,elements + n,number - 1);
    out << (it - elements + 1) << endl;
}
void answer(int *elements,int question,int number){
    if (question == 0) {
        answer_0(elements,number);
        return;
    } else if (question == 1) {
        answer_1(elements,number);
        return;
    } else {
        answer_2(elements,number);
        return;
    }
}

int main() {
    int question;
    int number;
    int *elements = (int*)malloc(1000001*sizeof(int)) ;

    in >> n;
    for(int i = 0; i < n; i++)
        in >> elements[i];

    in >> m;

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

    return 0;
}