#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
int arr[maxn], ans[maxn], arr2[maxn];
set<int> s;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &arr[i]);
  }
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    if (!s.count(x)) s.insert(x);
    arr2[x]++;
  }
  s.insert(1e7);
  for (int i = 1; i <= n; i++) {
    int num = n - arr[i];
    set<int>::iterator it = s.lower_bound(num);
    if (*it == 1e7) {
      set<int>::iterator ii = s.lower_bound(0);
      ans[i] = (*ii + arr[i]) % n;
      arr2[*ii]--;
      if (arr2[*ii] == 0) s.erase(ii);
    } else {
      ans[i] = (*it + arr[i]) % n;
      arr2[*it]--;
      if (arr2[*it] == 0) s.erase(it);
    }
  }
  for (int i = 1; i <= n; i++) {
    printf("%d ", ans[i]);
  }
  return 0;
}
