#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  cin >> n;
  long long a[n], b[n], c[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  map<long long, long long> m;
  map<long long, long long>::iterator it;
  map<long long, long long>::iterator it1;
  for (long long i = 0; i < n; i++) {
    cin >> b[i];
    m[b[i]]++;
  }
  for (long long i = 0; i < n; i++) {
    it = m.lower_bound(n - a[i]);
    it1 = m.lower_bound(0);
    if (it != m.end()) {
      c[i] = (it->first + a[i]) % n;
      m[it->first]--;
      if (m[it->first] == 0) m.erase(it);
    } else if (it1 != m.end()) {
      c[i] = (it1->first + a[i]) % n;
      m[it1->first]--;
      if (m[it1->first] == 0) m.erase(it1);
    }
  }
  for (long long i = 0; i < n; i++) {
    cout << c[i] << " ";
  }
  return 0;
}
