#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<long long, pair<long long, long long>>> pq;
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  while (T--) {
    bool flag = true, cond = true;
    long long n, i, j, x, y, ind, k, m, mn = INT_MAX, p = 0, mx = 0, diff, y1,
                                        count = 0;
    cin >> n;
    vector<long long> a(n), b(n);
    for (i = 0; i < n; i++) {
      cin >> a[i];
    }
    map<long long, long long> mp;
    for (j = 0; j < n; j++) {
      cin >> b[j];
      mp[b[j]]++;
    }
    vector<long long> c;
    map<long long, long long>::iterator it;
    for (i = 0; i < n; i++) {
      it = mp.lower_bound(n - a[i]);
      if (it == mp.end()) {
        it = mp.begin();
        c.push_back((a[i] + it->first) % n);
        if (it->second == 1)
          mp.erase(it->first);
        else
          mp[it->first]--;
      } else {
        c.push_back((a[i] + it->first) % n);
        if (it->second == 1)
          mp.erase(it->first);
        else
          mp[it->first]--;
      }
    }
    for (int iz = 0; iz < c.size(); iz++) {
      cout << c[iz] << " ";
    }
    cout << "\n";
    ;
  }
  return 0;
}
