#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double dinf = inf;
const int N = 2e5 + 10;
const int M = 18 + 10;
const int mod = 998244353;
const double eps = 1e-10;
const double PI = acos(-1.0);
int n;
int a[N], b[N], c[N], nxt[N];
int vis[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]), nxt[i] = i + 1;
  nxt[n] = 1;
  sort(b + 1, b + 1 + n);
  for (int i = 1; i <= (n); i++) {
    int pos = lower_bound(b + 1, b + 1 + n, n - a[i]) - b;
    if (pos > n) pos = 1;
    int j = pos;
    while (vis[j]) j = nxt[j];
    vis[j] = 1;
    c[i] = (a[i] + b[j]) % n;
    nxt[pos] = nxt[j];
  }
  for (int i = 1; i <= (n); i++) printf("%d ", c[i]);
  printf("\n");
  return 0;
}
