#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000010;
const int N = 200010;
template <typename T>
inline T sqr(T x) {
  return (x * x);
}
multiset<int> s;
int n;
int a[N];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    s.insert(x);
  }
  for (int i = 0; i < n; i++) {
    int x = a[i];
    multiset<int>::iterator it = s.lower_bound(n - x);
    if (it != s.end()) {
      cout << (*it + x) % n << " ";
      s.erase(it);
    } else {
      cout << (*s.begin() + x) % n << " ";
      s.erase(s.begin());
    }
  }
  return 0;
}
