#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long inf = 1e9;
struct th {
  long long first, second, third;
};
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
  return (a.first == b.second ? a.second > b.second : a.first < b.first);
}
bool cmp1(th a, th b) { return a.first > b.first; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << setprecision(20);
  int n;
  cin >> n;
  vector<int> a(n), c(n, -1);
  multiset<int> b;
  for (auto &i : a) {
    cin >> i;
  }
  for (int i = 0; i < n; i++) {
    int temp;
    cin >> temp;
    b.insert(temp);
  }
  int l = 0, r = n;
  for (int i = 0; i < n; i++) {
    auto it = b.lower_bound(n - a[i]);
    if (it == b.end()) --it;
    if (*it != n - a[i]) {
      if ((a[i] + (*b.begin())) % n < (a[i] + (*it)) % n) {
        it = b.begin();
      }
    }
    c[i] = ((*it) + a[i]) % n;
    if (!b.empty()) b.erase(it);
  }
  for (auto i : c) {
    cout << i << ' ';
  }
  return 0;
}
