#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  int n;
  cin >> n;
  vector <int> a;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    a.push_back(x);
  }
  int k;
  cin >> k;
  for (int i = 0; i < k; i++) {
    int x;
    cin >> x;
    a.push_back(x);
  }
  vector< array<int, 2>> v;
  for (int i = 0; i < a.size(); i++) {
    v.push_back({a[i], i});
  }
  sort(v.begin(), v.end(), [&](auto &i, auto &j){
    if (i[0] == j[0]) {
      return i[1] < j[1];
    } else return i[0] > j[0];
  });
  vector<int> res(k);
  for (int i = 0; i < v.size(); i++) {
    if (v[i][1] >= n) {
      res[v[i][1] - n] = i + 1;
    }
  }
  for (int i = 0; i < k; i++) {
    cout << res[i];
    if (i < k - 1) cout << " ";
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  // cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}