#include <bits/stdc++.h>
using namespace std;
multiset<int> s;
multiset<int>::iterator it;
const int maxn = 2e5 + 10;
int main() {
  int n;
  scanf("%d", &n);
  int a[maxn];
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < n; i++) {
    int num;
    scanf("%d", &num);
    s.insert(num);
  }
  it = s.begin();
  for (int i = 0; i < n; i++) {
    it = s.lower_bound(n - a[i]);
    if (it != s.end()) {
      if (i != n - 1)
        printf("%d ", (a[i] + *it) % n);
      else
        printf("%d\n", (a[i] + *it) % n);
      s.erase(it);
    } else {
      if (i != n - 1)
        printf("%d ", (a[i] + *s.begin()) % n);
      else
        printf("%d\n", (a[i] + *s.begin()) % n);
      s.erase(s.begin());
    }
  }
  return 0;
}
