#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 2e5 + 5;
int a[MAXN];
int co[MAXN];
set<int> second;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  for (int j = 0; j < n; j++) {
    int x;
    scanf("%d", &x);
    co[x]++;
    second.insert(x);
  }
  for (int i = 0; i < n; i++) {
    if (a[i] == 0) {
      auto l = second.begin();
      co[*l]--;
      printf("%d ", (a[i] + *l) % n);
      if (co[*l] == 0) {
        second.erase(*l);
      }
    } else {
      auto x = second.lower_bound(n - a[i]);
      if (x == second.end()) {
        x = second.begin();
      }
      co[*x]--;
      printf("%d ", (a[i] + *x) % n);
      if (co[*x] == 0) {
        second.erase(*x);
      }
    }
  }
}
