#include <bits/stdc++.h>
using namespace std;
const int N = 500023;
long long int vis[N] = {0};
vector<long long int> adj[N];
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> a, ans;
  multiset<long long int> b;
  for (long long int i = 0; i < n; i++) {
    long long int num;
    cin >> num;
    a.push_back(num);
  };
  for (long long int i = 0; i < n; i++) {
    long long int num;
    cin >> num;
    b.insert(num);
  }
  for (long long int i = 0; i < n; i++) {
    auto it = b.lower_bound(n - a[i]);
    if (it != b.end()) {
      ans.push_back(((*it) + a[i]) % n);
      b.erase(it);
    } else {
      auto it2 = b.begin();
      ans.push_back((*it2 + a[i]) % n);
      b.erase(it2);
    }
  }
  for (long long int i = 0; i < n; i++) cout << ans[i] << " ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int T;
  T = 1;
  long long int t = 0;
  while (t++ < T) {
    solve();
    cout << '\n';
  }
}
