#include <bits/stdc++.h>
const int inf = int(1e9);
const int mod = inf + 7;
const double PI = acos(-1.0);
using namespace std;
const int N = 1e5 + 155;
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  multiset<int> b;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    b.insert(x);
  }
  for (int i = 0; i < n; ++i) {
    auto it = b.lower_bound(n - a[i]);
    if (it == b.end()) it = b.begin();
    cout << (a[i] + *it) % n << " ";
    b.erase(it);
  }
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) solve();
  return 0;
}
