#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N], b[N];
int trr[N] = {0};
int n;
void add(int x, int val) {
  x++;
  for (int i = x; i <= n; i += (i & (-i))) {
    trr[i] += val;
  }
}
int query(int x) {
  x++;
  int res = 0;
  for (int i = x; i > 0; i -= (i & (-i))) res += trr[i];
  return res;
}
int getpos(int l, int r) {
  int mid, stand = l - 1;
  if ((query(r) - query(stand)) == 0) return -1;
  while (l <= r) {
    mid = (l + r) / 2;
    if (query(mid) - query(stand))
      r = mid - 1;
    else
      l = mid + 1;
  }
  return l;
}
int res[N];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  for (int i = 1; i <= n; i++) {
    scanf("%d", b + i);
    add(b[i], 1);
  }
  for (int i = 1; i <= n; i++) {
    int index = n - a[i];
    index %= n;
    int pos = getpos(index, n - 1);
    if (pos != -1) {
      res[i] = (a[i] + pos) % n;
      add(pos, -1);
      continue;
    }
    if (index > 0) {
      pos = getpos(0, index - 1);
      res[i] = (a[i] + pos) % n;
      add(pos, -1);
    }
  }
  for (int i = 1; i <= n; i++) printf("%d%c", res[i], i == n ? '\n' : ' ');
}
