#include <bits/stdc++.h>
using namespace std;
vector<int> a;
multiset<int> b;
int n, x;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x;
    a.push_back(x);
  }
  for (int i = 0; i < n; i++) {
    cin >> x;
    b.insert(x);
  }
  for (int i = 0; i < n; i++) {
    int target = n - a[i];
    auto p = b.lower_bound(target);
    if (p == b.end()) p = b.begin();
    cout << (*p + a[i]) % n << ' ';
    b.erase(p);
  }
  return 0;
}
