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