#include <bits/stdc++.h>
using namespace std;
void zanj0() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void out(vector<long long int>& v) {
  for (long long int i : v) {
    cout << i << " ";
  }
  cout << "\n";
}
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> a(n), b(n);
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  multiset<long long int> freq;
  for (long long int i = 0; i < n; i++) {
    cin >> b[i];
    b[i] %= n;
    freq.insert(b[i]);
  }
  for (long long int i = 0; i < n; i++) {
    long long int req = n - a[i];
    auto it = freq.lower_bound(req);
    long long int other = *(freq.begin());
    if (it == freq.end() || ((other + a[i]) % n) < ((*it + a[i]) % n)) {
      freq.erase(freq.lower_bound(other));
      a[i] += other;
      a[i] %= n;
    } else {
      a[i] += *it;
      freq.erase(it);
    }
    a[i] %= n;
  }
  out(a);
}
int main() {
  zanj0();
  solve();
  return 0;
}
