#include <bits/stdc++.h>
const int Inf = 2e9;
long long LINF = (long long)4e18;
using namespace std;
long long mod = 1e9 + 7;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  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) {
    if (b.lower_bound(n - a[i]) == b.end()) {
      cout << (a[i] + *b.begin()) % n << " ";
      b.erase(b.begin());
    } else {
      cout << (a[i] + *b.lower_bound(n - a[i])) % n << " ";
      b.erase(b.lower_bound(n - a[i]));
    }
  }
  return 0;
}
