/*
* Copyright (c) 2024 Emon Thakur
* All rights reserved.
*/
#include<bits/stdc++.h>
using namespace std;
//ofstream file("output11.txt");
bool cmp(int a,int b) {return a>b;}
bool cmp2(pair<int,int>a,pair<int,int>b)
{
if(a.first==b.first) return a.second<b.second;
return a>b;
}
void solve1()
{
int n; cin>>n;
vector<int>a(n);
for(int i=0;i<n;i++) cin>>a[i];
sort(a.begin(),a.end(),cmp);
int m; cin>>m;
vector<pair<int,int>>b(m);
for(int i=0;i<m;i++) cin>>b[i].first, b[i].second=i;
sort(b.begin(),b.end(),cmp2);
//for(auto e:b) cout<<e.first<<" "<<e.second<<endl;
int lo=0,hi=n-1,mid,ind;
int ans[m];
for(int i=0;i<m;i++)
{
int num = b[i].first;
lo = 0,hi=n-1,ind=0;
while(lo<=hi)
{
mid=(lo+hi)/2;
if(a[mid]>=num)
{
ind=mid+1;
lo=mid+1;
}
else hi=mid-1;
}
ans[b[i].second] = ind+1+i;
}
for(int i=0;i<m;i++) cout<<ans[i]<<" ";
}
void solve2()
{
int n,x; cin>>n;
vector<pair<int,int>>v;
for(int i=0;i<n;i++)
{
cin>>x;
v.push_back({x,-1});
}
int m; cin>>m;
for(int i=0;i<m;i++)
{
cin>>x;
v.push_back({x,i});
}
sort(v.begin(),v.end(),cmp2);
int ans[m];
for(int i=0;i<n+m;i++)
{
if(v[i].second!=-1) ans[v[i].second]=i+1;
}
for(int i=0;i<m;i++) cout<<ans[i]<<" ";
}
int main()
{
//freopen("input11.txt","r",stdin);
solve1();
}