#include <iostream>
#include <fstream>
using namespace std;

const int MAX_LEN = 100001;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");

int v[MAX_LEN];

int cautBin0(int n, int elem) {
    int stanga = 1, dreapta = n;
    while (stanga < dreapta) {
        int m = (stanga + dreapta) / 2;
        if (v[m] > elem) {
            dreapta = m;
        } else {
            stanga = m + 1;
        }
    }
    if (v[stanga] == elem) {
        return stanga;
    }
    if (v[stanga - 1] == elem) {
        return stanga - 1;
    }
    return -1;
}

int cautBin1(int n, int elem) {
    int stanga = 1, dreapta = n;
    while (stanga < dreapta) {
        int m = (stanga + dreapta) / 2;
        if (v[m] > elem) {
            dreapta = m;
        } else {
            stanga = m + 1;
        }
    }
    if (v[dreapta] <= elem) {
        return dreapta;
    }
    return dreapta - 1;
}

int cautBin2(int n, int elem) {
    int stanga = 1, dreapta = n;
    while (stanga < dreapta) {
        int m = (stanga + dreapta) / 2;
        if (v[m] < elem) {
            stanga = m + 1;
        } else {
            dreapta = m;
        }
    }
    if (v[stanga] >= elem) {
        return stanga;
    }
}

int main() {
    int n;
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
    }
    int m, intrebare, elem;
    fin >> m;
    for (int i = 1; i <= m; ++i) {
        fin >> intrebare >> elem;
        if (intrebare == 0) {
            fout << cautBin0(n, elem) << "\n";
        }
        if (intrebare == 1) {
            fout << cautBin1(n, elem) << "\n";
        }
        if (intrebare == 2) {
            fout << cautBin2(n, elem) << "\n";
        }
    }
}