#include <bits/stdc++.h>
using namespace std;
int v[200010];
map<int, int> st;
map<int, int>::iterator it;
int main() {
  int n, val, comp, aux;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &v[i]);
  for (int i = 0; i < n; i++) {
    scanf("%d", &val);
    if (st.count(val))
      st[val]++;
    else
      st[val] = 1;
  }
  for (int i = 0; i < n; i++) {
    comp = (n - v[i]) % n, aux = -1;
    while (aux == -1) {
      it = st.lower_bound(comp);
      if (it == st.end())
        comp = 0;
      else {
        comp = (*it).first;
        st[comp]--;
        if (st[comp] == 0) st.erase(comp);
        aux = comp;
      }
    }
    v[i] = (v[i] + aux) % n;
  }
  for (int i = 0; i < n; i++) {
    if (i != 0) printf(" ");
    printf("%d", v[i]);
  }
  printf("\n");
  return 0;
}
