#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 0;
const int mxn = 1e6 + 3, mod = 1e9 + 7;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
int32_t main()
{

    int n;
    cin >> n;
    ordered_set st;
    map<int,int>mp;
    for(int i = 0, a; i < n; i++)cin >> a, st.insert(-a), mp[-a]++;
    int q;
    cin >> q;
    int ar[q];
    for(int i = 0; i < q; i++)
    {
        cin >> ar[i];
        st.insert(-ar[i]);
    }
   
    for(int i = 0; i < q; i++)cout << (st.order_of_key(-ar[i]) + mp[-ar[i]] + 1) <<" ", mp[-ar[i]]++;
    cout << endl;
}