// i wants to take ioi
//binhtinhtutinkhongcaycunhungmotkhikhongcontutinnualatuyetvong
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define nn "\n"
#define pi pair<int, int>
#define ti tuple<int, int, int>
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define eb emplace_back
#define pb push_back
#define TASK " "

#define ms(a, x) memset(a, x, sizeof(a))
#define all(a) a.begin(), a.end()
#define All(a, n) a + 1, a + 1 + n

#define LOG 19

const int INF = 1e18;
const int N = 1e5 + 5;

int n, m;
int a[N];
int st[4 * N], lazy[4 * N];

void build(int id, int l, int r){
    if(l == r){
        st[id] = a[l];
        return;
    }

    int mid = (l + r) >> 1;

    build(id * 2, l, mid);
    build(id * 2 + 1, mid + 1, r);

    st[id] = max(st[id * 2], st[id * 2 + 1]);
}

void fix(int id, int val){
    st[id] += val;
    lazy[id] += val;
}

void down(int id){
    if(lazy[id] == 0) return;

    fix(id * 2, lazy[id]);
    fix(id * 2 + 1, lazy[id]);

    lazy[id] = 0;
}

void update(int id, int l, int r, int u, int v, int val){
    if(u > r || v < l) return;

    if(u <= l && r <= v){
        fix(id, val);
        return;
    }

    down(id);

    int mid = (l + r) >> 1;

    update(id * 2, l, mid, u, v, val);
    update(id * 2 + 1, mid + 1, r, u, v, val);

    st[id] = max(st[id * 2], st[id * 2 + 1]);
}

int get(int id, int l, int r, int x){
    if(st[id] < x) return n + 1;

    if(l == r) return l;

    down(id);

    int mid = (l + r) >> 1;

    int res = get(id * 2, l, mid, x);

    if(res != n + 1) return res;

    return get(id * 2 + 1, mid + 1, r, x);
}

void solve(){
    cin >> n;

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

    sort(a + 1, a + n + 1);

    build(1, 1, n);

    cin >> m;

    for(int i = 1; i <= m; i++){
        int t;
        cin >> t;

        int p = get(1, 1, n, t);

        if(p == n + 1){
            cout << 0 << " ";
        }
        else{
            cout << n - p + 1 << " ";
            update(1, 1, n, p, n, -1);
        }
    }

    cout << nn;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return (0 ^ 0);
}