#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long int n;
  cin >> n;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i];
  multiset<long long int> ms;
  for (long long int i = 0; i < n; i++) {
    long long int t;
    cin >> t;
    ms.insert(t);
  }
  for (long long int i = 0; i < n; i++) {
    long long int fst = *ms.begin();
    auto temp = ms.lower_bound(n - a[i]);
    if (temp != ms.end()) {
      long long int md = *temp;
      if ((a[i] + fst) % n <= (a[i] + md) % n) {
        cout << (a[i] + fst) % n << " ";
        ms.erase(ms.find(fst));
      } else if ((a[i] + fst) % n > (a[i] + md) % n) {
        cout << (a[i] + md) % n << " ";
        ms.erase(ms.find(md));
      }
    } else {
      cout << (a[i] + fst) % n << " ";
      ms.erase(ms.find(fst));
    }
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long int t = 1;
  while (t--) {
    solve();
  }
}
