#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n, q;
int main(){
    cin >> n;
    vector <int> x(n + 1);
    for (int i = 1; i < n + 1; ++i)
        cin >> x[i];
    cin >> q;
    vector <int> m(q + 1);
    for (int i = 1; i < q + 1; ++i)
        cin >> m[i];
    sort(x.begin(), x.end());
    for (int i = 1; i < q + 1; ++i){
        int l = -1; int r = n + 1; int mid = (l + r)/2;
        while (r > l + 1){
            if (m[i] >= x[mid])
                l = mid;
            else r = mid;
            mid = (l+r)/2;
        }
        cout << l << endl;
    }

}