#include <bits/stdc++.h>
using namespace std;
int n, i, j, x, a[200005];
map<int, int> b;
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> x;
    a[i] = x % n;
  }
  for (i = 1; i <= n; i++) {
    cin >> x;
    b[x % n]++;
  }
  for (i = 1; i <= n; i++) {
    auto it = b.lower_bound(n - a[i]);
    if (it == b.end()) it = b.begin();
    cout << (a[i] + it->first) % n << ' ';
    it->second--;
    if (it->second == 0) b.erase(it);
  }
  return 0;
}
