#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e9 + 7;
const double pi =
    3.14159265358979323846264338327950288419716939937510582097494459;
const int N = 1e5 + 5;
const int oo = 1e9 + 7;
const long long OO = 1e18;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  vector<int> a(n);
  map<int, int> mp;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    mp[x]++;
  }
  for (int i = 0; i < n; i++) {
    int needed = (n - a[i]) % n;
    map<int, int>::iterator it = mp.lower_bound(needed);
    if (it == mp.end()) it = mp.begin();
    cout << (a[i] + it->first) % n << " ";
    if (it->second == 1) {
      mp.erase(it->first);
    } else
      (it->second)--;
  }
  cout << endl;
}
