#include <bits/stdc++.h>
using namespace std;
int a[200001];
multiset<int> b;
int main() {
  int i, j, x = 0, n;
  cin >> n;
  for (i = 0; i < n; i++) cin >> a[i];
  for (i = 0; i < n; i++) {
    cin >> x;
    b.insert(x);
  }
  for (i = 0; i < n; i++) {
    int need = n - a[i];
    auto it1 = b.lower_bound(need);
    auto it2 = b.begin();
    if (it1 != b.end()) {
      int ax1 = *it1;
      int ax2 = *it2;
      ax1 = (ax1 + a[i]) % n;
      ax2 = (ax2 + a[i]) % n;
      if (ax2 < ax1) it1 = it2;
    } else
      it1 = it2;
    a[i] = (a[i] + (*it1)) % n;
    b.erase(it1);
  }
  for (i = 0; i < n; i++) cout << a[i] << ' ';
  return 0;
}
