#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 6;
long long a[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  long long sum = 0;
  for (int i = 1; i <= n; i++) sum += a[i] - a[1] + 1 - i;
  long long tmp = a[1];
  for (int i = 1; i <= n; i++) a[i] = tmp + i - 1 + sum / n;
  for (int i = 1; i <= sum % n; i++) a[i]++;
  for (int i = 1; i <= n; i++) printf("%lld ", a[i]);
  return 0;
}
