#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N], b[N], d[N];
int c, n;
struct bitree {
  int u[N];
  void modify(int x, int v) {
    for (; x <= n; x += x & (-x)) u[x] += v;
  }
  int getsum(int x) {
    int res = 0;
    for (; x; x -= x & (-x)) res += u[x];
    return res;
  }
  int find(int k) {
    int res = 0, cnt = 0;
    for (int i = 18; i >= 0; --i) {
      res += 1 << i;
      if (res >= n || u[res] + cnt >= k)
        res -= 1 << i;
      else
        cnt += u[res];
    }
    return res + 1;
  }
} f, g;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", a + i);
    a[i]++;
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d", b + i);
    b[i]++;
  }
  for (int i = n - 1; i >= 0; --i) {
    int x = f.getsum(a[i]), y = g.getsum(b[i]);
    d[i] = x + y + c, c = d[i] / (n - i), d[i] %= (n - i);
    f.modify(a[i], 1), g.modify(b[i], 1);
  }
  for (int i = 0; i < n; ++i) {
    a[i] = f.find(d[i] + 1);
    f.modify(a[i], -1);
  }
  for (int i = 0; i < n; ++i) {
    printf("%d%c", a[i] - 1, " \n"[i == n - 1]);
  }
  return 0;
}
