#include <bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
// #define int long long
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define CheckBit(x,k)   (x & (1LL << k))
#define SetBit(x,k)     (x |= (1LL << k))
#define ClearBit(x,k)   (x &= ~(1LL << k))
#define LSB(mask)       __builtin_ctzll(mask)
#define MSB(mask)       63-__builtin_clzll(mask) 
#define print(x)    cout << #x << " : " << x << endl
#define error1(x)   cerr << #x << " = " << (x) <<endl
#define coutall(v)  for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52     ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x)   sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}

const int N = 1e5 + 10;
int n, m;
bool cmp(pair<int,int>a,pair<int,int>b)
{
    if(a.first!=b.first)
    {
        return a.first>b.first;
    }
    else
    {
        if((a.S<m && b.S<m) || (a.S>=m && b.S>=m))
        {
            return a.S<b.S;
        }
        else
        {
            return a.S>b.S;
        }
    }
}
void solve()
{
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i];
    }
    cin>>m;
    vector<int> v1(m);
    vector<pair<int,int>>ans;
    for (int i = 0; i < m; i++)
    {
        cin >> v1[i];
        ans.pb({v1[i],i});
    }
    int j=m;
    for (int i = 0; i < n; i++)
    {
        ans.pb({v[i],j});
        j++;
    }
    sort(all(ans),cmp);
    vector<int>res(m+1,0);
    for(int i=0;i<ans.size();i++)
    {
        if(ans[i].S<m)
        {
            res[ans[i].S]=i+1;
        }
    }
    for(int i=0;i<m;i++)
    {
        cout<<res[i]<<" ";
    }
}

int32_t main()
{
    Abid_52;
    int t = 1;
    // cin >> t;
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
}