#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, a[N], b[N];
multiset<int> S;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    cin >> b[i];
    S.insert(b[i]);
  }
  for (int i = 1; i <= n; i++) {
    int t = n - a[i];
    auto it = S.lower_bound(t);
    if (it == S.end()) {
      it = S.begin();
    }
    cout << (a[i] + *it) % n;
    if (i == n)
      cout << endl;
    else
      cout << ' ';
    S.erase(it);
  }
  return 0;
}
