#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
deque<long long int> mods[200010];
set<long long int> access;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, b;
  cin >> n;
  long long int arr[n];
  for (long long int i = 0; i < n; i++) cin >> arr[i];
  for (long long int i = 0; i < n; i++) {
    cin >> b;
    mods[b % n].push_back(b);
    access.insert(b % n);
  }
  for (long long int i = 0; i < n; i++) {
    long long int cur = arr[i];
    long long int tar = (n - arr[i] % n) % n;
    if (access.find(tar) != access.end()) {
      long long int t = mods[tar].front();
      mods[tar].pop_front();
      cout << (cur + t) % n << " ";
      if (mods[tar].size() == 0) access.erase(tar);
    } else {
      auto it = access.lower_bound({tar});
      if (access.lower_bound({tar}) == access.end())
        tar = *access.begin();
      else
        tar = *it;
      long long int t = mods[tar].front();
      mods[tar].pop_front();
      cout << (cur + t) % n << " ";
      if (mods[tar].size() == 0) access.erase(tar);
    }
  }
  cout << endl;
  return 0;
}
