#include <bits/stdc++.h>
using namespace std;
int t[1500000];
int t1[1500000];
long long fact[1500000];
int cnt[1500000];
long long n, m, k, l, r;
long long ans;
int so;
bool test;
set<int> st;
map<int, int> mapp;
vector<int> v[1500000];
int sz[1500000];
vector<pair<int, int> > s;
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> t[i];
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    mapp[a]++;
  }
  map<int, int>::iterator it;
  for (int i = 0; i < n; i++) {
    int j;
    it = mapp.lower_bound(n - t[i]);
    if (it == mapp.end())
      j = (mapp.begin())->first;
    else
      j = (it)->first;
    if (mapp[j] == 1)
      mapp.erase(j);
    else
      mapp[j]--;
    t1[i] = j;
  }
  for (int i = 0; i < n; i++) cout << (t[i] + t1[i]) % n << " ";
}
