G

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

unsigned int n, q, m, k, v;

unsigned int find_n_shops(const unsigned int money, unsigned int x[]) {
  unsigned int l = 0, r = n - 1, ans;
  while (l <= r) {
    v = (l + r) / 2;
    if (money >= x[v]) {
      l = v + 1;
      ans = v;
    } else {
      r = v - 1;
    }
  }
  return ans;
}

int main(void) {
  scanf("%u", &n);
  unsigned int x[n], temp;
  for (int i = 0; i < n; i++) {
    scanf("%u", &temp);
    x[i] = temp;
  }
  scanf("%u", &q);
  unsigned int m[q];
  for (int i = 0; i < q; i++) {
    scanf("%u", &temp);
    m[i] = temp;
  }
  sort(x, x + n);

  for (int i = 0; i < q; i++) {
    printf("%u\n", find_n_shops(m[i], x));
    // printf("%u\n", *upper_bound(x, x + n, q));
  }
  return 0;
}