#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  multiset<long long> s;
  for (long long i = 0; i < n; i++) {
    long long x;
    cin >> x;
    s.insert(x);
  }
  for (long long i = 0; i < n; i++) {
    long long temp = abs(a[i] - n);
    auto it1 = s.lower_bound(temp);
    auto it2 = s.lower_bound(0);
    long long mini = 2e18;
    mini = min(mini, (a[i] + (*it2)) % n);
    if (it1 == s.end()) {
      s.erase(it2);
      cout << mini << " ";
      continue;
    }
    if ((a[i] + (*it1)) % n < mini) {
      mini = (a[i] + (*it1)) % n;
      s.erase(it1);
      cout << mini << " ";
      continue;
    } else {
      s.erase(it2);
      cout << mini << " ";
    }
  }
}
