#include <bits/stdc++.h>
const int M = 1e9 + 7;
const int N = 2e5 + 5;
using namespace std;
int main() {
  long long int n;
  cin >> n;
  long long int a[n], b[n];
  multiset<long long int> bi;
  for (long long int i = 0; i < n; ++i) cin >> a[i];
  for (long long int i = 0; i < n; ++i) {
    long long int x;
    cin >> x;
    bi.insert(x);
  }
  for (long long int i = 0; i < n; ++i) {
    long long int g = n - a[i];
    auto it = bi.lower_bound(g);
    if (it == bi.end()) it = bi.begin();
    cout << (a[i] + *it) % n << " ";
    bi.erase(it);
  }
}
