#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
inline int add(int a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
  return a;
}
inline int sub(int a, int b) {
  a -= b;
  if (a < 0) a += MOD;
  return a;
}
inline int mul(int a, int b) { return (int)((long long)a * b % MOD); }
inline int binpow(int a, int b) {
  int res = 1;
  while (b > 0) {
    if (b & 1) res = mul(res, a);
    a = mul(a, a);
    b /= 2;
  }
  return res;
}
inline int inv(int a) { return binpow(a, MOD - 2); }
int gcd(int a, int b, int &x, int &y) {
  if (a == 0) {
    x = 0, y = 1;
    return b;
  }
  int x1, y1;
  int d = gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<int> a(n), b(n), c(n);
  multiset<int> s;
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < n; ++i) {
    cin >> b[i];
    s.insert(b[i]);
  }
  for (int i = 0; i < n; ++i) {
    int val = (n - a[i]) % n;
    auto it = s.lower_bound(val);
    if (it == s.end()) {
      it = s.lower_bound(0);
      c[i] = (a[i] + (*it)) % n;
    } else {
      c[i] = (a[i] + (*it)) % n;
    }
    s.erase(it);
  }
  for (int i = 0; i < n; ++i) cout << c[i] << " ";
  cout << "\n";
  return 0;
}
