#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 2;
multiset<int> s;
int a[maxn], b[maxn], c[maxn], n;
int main() {
  cin >> 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++) {
    auto p = s.lower_bound(n - a[i]);
    if (p == s.end()) p = s.begin();
    c[i] = (a[i] + *p) % n;
    s.erase(p);
    cout << c[i] << " ";
  }
}
