#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  cout.tie(0);
  cout.sync_with_stdio(0);
  int n;
  cin >> n;
  long long a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long base = a[0];
  for (int i = 0; i < n; i++) {
    a[i] -= base;
  }
  long long secc = 0;
  for (int i = 1; i < n; i++) secc += a[i] - i;
  long long t = secc / n;
  long long res = secc % n;
  for (int i = 0; i < res; i++) {
    cout << (long long)(base + i + 1 + t) << " ";
  }
  for (int i = res; i < n; i++) {
    cout << (long long)(base + i + t) << " ";
  }
  return 0;
}
