#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200010;
multiset<int> B;
multiset<int>::iterator it;
int N, A[MAXN];
int main() {
  cin >> N;
  for (int i = 1; i <= N; ++i) scanf("%d", &A[i]);
  for (int i = 1; i <= N; ++i) {
    int v;
    scanf("%d", &v);
    B.insert(v);
  }
  for (int i = 1; i <= N; ++i) {
    it = B.lower_bound(N - A[i]);
    if (it == B.end()) {
      it = B.begin();
      printf("%d ", A[i] + *it);
      B.erase(it);
    } else {
      printf("%d ", A[i] + *it - N);
      B.erase(it);
    }
  }
  return 0;
}
