#include <bits/stdc++.h>
using namespace std;
int a[100100], h[100100], mx[100100];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
  }
  for (int i = n; i >= 1; i--) {
    mx[i] = max(mx[i + 1], a[i]);
  }
  for (int i = 1; i <= n; i++) {
    if (a[i] > mx[i + 1]) continue;
    h[i] = mx[i + 1] + 1 - a[i];
  }
  for (int i = 1; i <= n; i++) cout << h[i] << ' ';
  return 0;
}
