<需要lower_bound哦>

#include<bits/stdc++.h>
using namespace std;
int n,m;
int a[100010],b[100010];
int main(){
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
    }
    cin >> m;
    for(int i = 1;i <= m;i++){
        cin >> b[i];
    }
    sort(a + 1,a + 1 + n);
    int i = 1;
    while(i <= m){
        int w = lower_bound(a + 1,a + n,b[i]) - a;
        cout << w - 1 << endl;
        i++;
    }
    
    return 0;
}