#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = (long long)a * a % m)
    if (b & 1) ans = (long long)ans * a % m;
  return ans;
}
int p[200010], q[200010];
int b[200010];
int r[200010], s[200010], t[200010];
int ans[200010], vst[200010];
void add(int k, int first) {
  while (k < 200010) {
    b[k] += first;
    k += k & (-k);
  }
}
int sum(int k) {
  int s = 0;
  while (k >= 1) {
    s += b[k];
    k -= k & (-k);
  }
  return s;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i]);
    p[i]++;
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &q[i]);
    q[i]++;
  }
  for (int i = 1; i <= n; i++) add(i, 1);
  int k = 0;
  for (int i = 1; i <= n; i++) {
    r[++k] = sum(p[i] - 1);
    add(p[i], -1);
  }
  k = 0;
  for (int i = 1; i < 200010; i++) b[i] = 0;
  for (int i = 1; i <= n; i++) add(i, 1);
  for (int i = 1; i <= n; i++) {
    s[++k] = sum(q[i] - 1);
    add(q[i], -1);
  }
  int R = 0;
  for (int i = n - 1; i >= 1; i--) {
    t[i] = r[i] + s[i] + R;
    int q = t[i] / (n - i + 1);
    int rr = t[i] % (n - i + 1);
    t[i] = rr;
    R = q;
  }
  for (int i = 1; i <= n - 1; i++) t[i]++;
  for (int i = 1; i < 200010; i++) b[i] = 0;
  for (int i = 1; i <= n; i++) add(i, 1);
  for (int i = 1; i < n; i++) {
    int st = 0, ed = n;
    while (st + 1 < ed) {
      int mid = (st + ed) >> 1;
      if (sum(mid) < t[i])
        st = mid;
      else
        ed = mid;
    }
    add(ed, -1);
    ans[i] = ed;
  }
  for (int i = 1; i < n; i++) vst[ans[i]] = 1;
  for (int i = 1; i < n; i++) printf("%d ", ans[i] - 1);
  for (int i = 1; i <= n; i++) {
    if (!vst[i]) {
      printf("%d ", i - 1);
      break;
    }
  }
  return 0;
}
