#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 4;
int n;
int a[maxn];
set<int> st;
map<int, int> mp;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  int x, y;
  for (int i = 0; i < n; ++i) {
    cin >> x;
    mp[x]++;
    st.insert(x);
  }
  int val;
  for (int i = 0; i < n; ++i) {
    y = n - a[i];
    val = *(st.lower_bound(y));
    if (st.find(val) == st.end() or val < y) {
      val = *st.begin();
    }
    cout << (val + a[i]) % n << ' ';
    mp[val]--;
    if (mp[val] == 0) st.erase(val);
  }
}
