#include <bits/stdc++.h>
using namespace std;
const long long N = 300000;
long long a[N], b[N], c[N], counti[N];
multiset<long long> st;
int main() {
  ios_base::sync_with_stdio(false);
  long long i, n, k, z;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    c[i] = (n - a[i]) % n;
  }
  for (i = 0; i < n; i++) {
    cin >> b[i];
    st.insert(b[i]);
  }
  for (i = 0; i < n; i++) {
    k = c[i];
    auto it = st.lower_bound(k);
    if (it == st.end()) it = st.begin();
    c[i] = (a[i] + *it) % n;
    st.erase(it);
  }
  for (i = 0; i < n; i++) cout << c[i] << " ";
  return 0;
}
