//
//  main.cpp
//  Cautare binara (infoarena)
//
//  Created by Andrei Bădulescu on 18.01.23.
//

//#include <iostream>
#include <fstream>

using namespace std;

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

const int N = 100000;

int numbers[N + 1];
int n, m;

int bSearchFull(int value) {
    int st = 1, dr = n;
    int mij, result = -1;

    while (st <= dr) {
        mij = (st + dr) / 2;

        if (value >= numbers[mij]) {
            if (value == numbers[mij]) {
                result = mij;
            }

            st = mij + 1;
        } else {
            dr = mij - 1;
        }
    }

    return result;
}

int bSearchLower(int value) {
    int st = 1, dr = n;
    int mij, result = 0;

    while (st <= dr) {
        mij = (st + dr) / 2;

        if (value >= numbers[mij]) {
            st = mij + 1;
            result = mij;
        } else {
            dr = mij - 1;
        }
    }

    return result;
}

int bSearchHigher(int value) {
    int st = 1, dr = n;
    int mij, result = 0;

    while (st <= dr) {
        mij = (st + dr) / 2;

        if (value <= numbers[mij]) {
            dr = mij - 1;
            result = mij;
        } else {
            st = mij + 1;
        }
    }

    return result;
}

int main() {
    cin >> n;

    for (auto i = 1; i <= n; i++) {
        cin >> numbers[i];
    }

    cin >> m;

    for (auto i = 1; i <= m; i++) {
        int type, value;
        cin >> type >> value;

        if (type == 0) {
            cout << bSearchFull(value) << '\n';
        }

        if (type == 1) {
            cout << bSearchLower(value) << '\n';
        }

        if (type == 2) {
            cout << bSearchHigher(value) << '\n';
        }
    }

    return 0;
}