#include <bits/stdc++.h>
using namespace std;
int a[200005], b[200005];
int n;
map<int, int> mapp;
int c[200005];
int main() {
  ios_base::sync_with_stdio(0);
  ;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> b[i];
    mapp[b[i]]++;
  }
  for (int i = 0; i < n; i++) {
    if (a[i] == 0) {
      int tof = 0;
      auto it = mapp.lower_bound(tof);
      if (it != mapp.end()) {
        c[i] = (it->first + a[i]) % n;
        it->second -= 1;
        if (it->second == 0) {
          mapp.erase(it);
        }
      }
    } else {
      int tof = n - a[i];
      auto it = mapp.lower_bound(tof);
      if (it != mapp.end()) {
        c[i] = (it->first + a[i]) % n;
        it->second -= 1;
        if (it->second == 0) {
          mapp.erase(it);
        }
      } else {
        tof = 0;
        auto it = mapp.lower_bound(tof);
        if (it != mapp.end()) {
          c[i] = (it->first + a[i]) % n;
          it->second -= 1;
          if (it->second == 0) {
            mapp.erase(it);
          }
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    cout << c[i] << " ";
  }
  cout << endl;
  return 0;
}
