#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5, inf = 1e18;
long long n, tmp, a[N];
multiset<long long> s;
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (long long i = 1; i <= n; i++) {
    cin >> tmp;
    s.insert(tmp);
  }
  for (long long i = 1; i <= n; i++) {
    auto it = s.lower_bound((n - a[i]) % n);
    if (it != s.end()) {
      cout << (a[i] + (*it)) % n << " ";
      s.erase(s.find((*it)));
    } else {
      cout << (a[i] + (*s.begin())) % n << " ";
      s.erase(s.begin());
    }
  }
  return 0;
}
