#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int TESTS = 1;
  while (TESTS--) {
    long long int n;
    cin >> n;
    long long int a[n + 1], b[n + 1];
    for (long long int i = 1; i <= n; i++) cin >> a[i];
    for (long long int i = 1; i <= n; i++) cin >> b[i];
    multiset<long long int> s;
    for (long long int i = 1; i <= n; i++) s.insert(b[i]);
    for (long long int i = 1; i <= n; i++) {
      long long int opt1 = *s.begin();
      if (s.lower_bound(n - a[i]) == s.end()) {
        cout << (a[i] + opt1) % n << " ";
        s.erase(s.find(opt1));
        continue;
      }
      long long int opt2 = *s.lower_bound(n - a[i]);
      if ((a[i] + opt1) % n < (a[i] + opt2) % n) {
        cout << (a[i] + opt1) % n << " ";
        s.erase(s.find(opt1));
      } else {
        cout << (a[i] + opt2) % n << " ";
        s.erase(s.find(opt2));
      }
    }
  }
  return 0;
}
