#include <bits/stdc++.h>
using namespace std;
int n;
int a[100100];
pair<int, int> p[100100];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", a + i);
    p[i] = make_pair(a[i], i);
  }
  sort(p, p + n);
  reverse(p, p + n);
  int len = 0;
  for (int i = 0; i < n - 1; i++) {
    while (p[len].second < i) {
      len++;
    }
    if (p[len].second == i) {
      printf("0 ");
      continue;
    }
    printf("%d ", p[len].first - a[i] + 1);
  }
  printf("0");
  return 0;
}
