#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  multiset<long long> b;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    long long x;
    cin >> x;
    b.insert(x);
  }
  vector<long long> v(n, -1);
  for (int i = 0; i < n; i++) {
    long long val = (n - a[i]) % n;
    auto it = b.lower_bound(val);
    if (it != b.end()) {
      a[i] = (*it + a[i]) % n;
      b.erase(it);
    } else {
      a[i] = (*b.begin() + a[i]) % n;
      b.erase(b.begin());
    }
  }
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << endl;
}
