#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  vector<int> va;
  vector<int> res;
  map<int, int> vb;
  map<int, int>::iterator itr;
  int i, h, j;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> h;
    va.push_back(h);
  }
  for (i = 0; i < n; i++) {
    cin >> h;
    itr = vb.find(h);
    if (itr == vb.end())
      vb.insert(make_pair(h, 0));
    else
      itr->second++;
  }
  for (i = 0; i < n; i++) {
    h = n - va[i];
    itr = vb.lower_bound(h);
    if (itr == vb.end()) {
      itr = vb.begin();
      h = itr->first;
    } else
      h = itr->first;
    if (itr->second != 0)
      itr->second--;
    else
      vb.erase(itr);
    res.push_back((va[i] + h) % n);
  }
  for (i = 0; i < n; i++) {
    if (i + 1 != n)
      printf("%d ", res[i]);
    else
      printf("%d\n", res[i]);
  }
}
