#include <bits/stdc++.h>
#include <iostream>
using namespace std;

typedef long long ll;
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define mp make_pair
#define pq priority_queue<int>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define f(i, n) for (int i = 0; i < n; i++)
#define PI acos(-1)
const int M = 1e9 + 7;
ll binExp(ll a, ll b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = res * a;
        a *= a;
        b /= 2;
    }
    return res;
}
ll gcd(ll a, ll b) {
    if (a == 0)
        return b;
    return gcd(b % a, a);
}
ll lcm(ll a, ll b) {
    return (a / gcd(a, b)) * b;
}
void solve() {
    int n, m;
    cin >> n;
    vector<int> v1(n);
    f(i, n) cin >> v1[i];
    cin >> m;
    map<int, int> first;
    vector<int> v2(m), v3, v, v4;
    map<int, int> mp;
    f(i, m) cin >> v2[i];
    v, v4 = v1;
    f(i, m) v, v4.push_back(v2[i]);
    sort(all(v));
    v4 = v2;
    sort(all(v4));
    f(i, n) first[v1[i]]++;
    // for (auto a : v,v4)
    //     cout << a << ' ';
    v3 = v1;
    sort(all(v3));
    f(i, m) {
        int x = v2[i];
        ll temp =
            n - (upper_bound(all(v3), x) - v3.begin());  // x theke boro in v
        // cout << temp << '\n';
        ll sec = m - (upper_bound(all(v4), x) - v4.begin());
        // cout << temp << ' ' << sec << ' ' << mp[x] << '\n';
        cout << temp + sec + mp[x] + first[x] + 1 << ' ';
        mp[x]++;
    }
}
int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}