#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n;
  cin >> n;
  long long int a[n];
  long long int sum = 0;
  for (long int i = 0; i < n; i++) scanf("%lld", &a[i]), sum += a[i];
  long long int ans[n];
  long long int l = 0, r = 1e12;
  long long int mid = 0;
  while (l <= r) {
    mid = (l + r) / 2;
    long long int temp1 = mid * n;
    long long int temp2 = temp1 + (n * (n - 1)) / 2;
    if (temp1 <= sum && temp2 >= sum) {
      r = mid - 1;
    }
    if (temp2 < sum)
      l = mid + 1;
    else
      r = mid - 1;
  }
  mid = l;
  long long int aa = 0;
  for (long int i = 0; i < n; i++) {
    long long int temp1 = mid * (n - i);
    long long int temp2 = temp1 + ((n - i) * (n - i - 1)) / 2;
    if (temp1 <= sum - aa && temp2 >= sum - aa)
      ans[i] = mid;
    else
      ans[i] = ++mid;
    aa += ans[i];
  }
  for (long int i = 0; i < n; i++) cout << ans[i] << " ";
  return 0;
}
