#include <bits/stdc++.h>
using namespace std;
int p[300100], q[300100], bit[300100], n, vis[300100];
int sum(int x) {
  int ret = 0;
  while (x > 0) {
    ret += bit[x];
    x -= x & -x;
  }
  return ret;
}
void add(int i, int x) {
  while (i <= n) {
    bit[i] += x;
    i += i & -i;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &p[i]);
    int tmp = sum(p[i]);
    q[i] += p[i] - tmp;
    add(p[i] + 1, 1);
  }
  memset(bit, 0, sizeof(bit));
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &p[i]);
    int tmp = sum(p[i]);
    q[i] += p[i] - tmp;
    add(p[i] + 1, 1);
    vis[i] = 1;
  }
  for (int i = n; i > 0; --i)
    if (q[i] >= (n - i + 1)) {
      q[i - 1] += q[i] / (n - i + 1);
      q[i] %= (n - i + 1);
    }
  memset(bit, 0, sizeof(bit));
  for (int i = 1; i <= n; ++i) {
    int l = 1, r = n, ans;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (sum(mid) + q[i] + 1 <= mid) {
        r = mid - 1;
        if (sum(mid) + q[i] + 1 == mid) ans = mid;
      } else
        l = mid + 1;
    }
    cout << ans - 1 << " ";
    add(ans, 1);
    vis[ans] = 0;
  }
  return 0;
}
