#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, i, a[200001] = {0}, b[200001] = {0}, c[200001] = {0};
  set<long long> s;
  map<long long, long long> m;
  cin >> n;
  for (i = 0; i < n; i++) cin >> a[i];
  for (i = 0; i < n; i++) {
    cin >> b[i];
    s.insert(b[i]);
    m[b[i]]++;
  }
  for (i = 0; i < n; i++) {
    long long req = (n - a[i] + n) % n;
    auto it = s.lower_bound(req);
    if (it == s.end()) it = s.begin();
    c[i] = (a[i] + (*it)) % n;
    m[*it]--;
    if (m[*it] == 0) s.erase(*it);
  }
  for (i = 0; i < n; i++) cout << c[i] << " ";
  return 0;
}
