#include <fstream>
#include <vector>

using namespace std;

int SIZE, Q;

int MaxPos(const vector<int>& V, int n) {
    int maxPos = -1;

    int start = 0;
    int end = SIZE;

    while(start < end) {
        int middle = (start+end)/2;
        if(V[middle] <= n) {
            start = middle+1;
            if(V[middle] == n) {
                maxPos = middle;
            }
        } else {
            end = middle;
        }
    }
    
    if(maxPos < 0) {
        return maxPos;
    }
    return maxPos+1;    
}


int LessThan(const vector<int>& V, int n) {
    int start = 0;
    int end = SIZE;
    int result = 0;
    while(start < end) {
        int middle = (start+end)/2;
        if(V[middle] <= n) {
            result = middle;
            start = middle+1;
        } else {
            end = middle;
        }
    }
   
    if(V[start] <= n) {
        result = start;
    }

    return result;
}

int BiggerThan(const vector<int>& V, int n) {
    int start = 0;
    int end = SIZE;
    int result = SIZE-1;
    while(start < end) {
        int middle = (start+end)/2;
        if(V[middle] >= n) {
            end = middle;
            result = middle;
        } else {
            start = middle+1;
        }
    }

    if(V[start] >= n) {
        result = start;
    }

    return result+1;
}
    
int main() {
    
    ifstream f("cautbin.in");
    ofstream g("cautbin.out");

    f >> SIZE;

    vector<int> V;

    for(int i = 0; i < SIZE; i++){
        int elem;
        f >> elem;
        V.push_back(elem);
    }
    
    f >> Q;
    int q, n;

    for(int i = 0; i < Q; i++) {
        f >> q >> n;
        if(q == 0) {
            g << MaxPos(V,n) << endl;
        } else if(q == 1) {
            g << LessThan(V, n) << endl;
        } else if(q == 2) {
            g << BiggerThan(V, n) << endl;
        }
    }

    return 0;
}