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

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

int cautaUltimaAparitie(const vector<int>& sir, int x)
{
    int st = 0, dr = sir.size() - 1;
    int raspuns = -2;
    while (st <= dr) {
        int mij = (st + dr) / 2;
        if (sir[mij] == x) 
        {
            raspuns = mij;
            st = mij + 1;
        }
        else if (sir[mij] < x) st = mij + 1;
        else dr = mij - 1;
    }
    return raspuns;
}

int cautaUltimaMaiMicSauEgal(const vector<int>& sir, int x) 
{
    int st = 0, dr = sir.size() - 1;
    int raspuns = -1;
    while (st <= dr) 
    {
        int mij = (st + dr) / 2;
        if (sir[mij] <= x) 
        {
            raspuns = mij;
            st = mij + 1;
        }
        else dr = mij - 1;
    }
    return raspuns;
}

int cautaPrimaMaiMareSauEgal(const vector<int>& sir, int x) 
{
    int st = 0, dr = sir.size() - 1;
    int raspuns = -1;
    while (st <= dr)
    {
        int mij = (st + dr) / 2;
        if (sir[mij] >= x) 
        {
            raspuns = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }
    return raspuns;
}

int main() {
    int n;
    cin >> n;
    vector<int> sir(n);
    for (int i = 0; i < n; i++) cin >> sir[i];
    int m;
    cin >> m;
    for (int i = 0; i < m; i++) 
    {
        int tip, x;
        cin >> tip >> x;
        int pozitie;
        if (tip == 0) 
        {
            pozitie = cautaUltimaAparitie(sir, x);
            cout << pozitie + 1 << "\n";
        }
        else if (tip == 1) 
        {
            pozitie = cautaUltimaMaiMicSauEgal(sir, x);
            cout << pozitie + 1 << "\n";
        }
        else if (tip == 2) 
        {
            pozitie = cautaPrimaMaiMareSauEgal(sir, x);
            cout << pozitie + 1 << "\n"; 
        }
    }

    return 0;
}