#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int M = 1e6 + 6;
long long a[M], b[M], posmx[M];
int nex[] = {1, -1, 0, 0};
int ney[] = {0, 0, 1, -1};
void py() { cout << "YES" << '\n'; }
void pn() { cout << "NO" << '\n'; }
int main() {
  long long n;
  scanf("%lld", &n);
  long long S = 0;
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), S += a[i];
  long long tmp = S - n * (n - 1) / 2;
  for (int i = 1; i <= n; i++) {
    long long x = 1ll * i - 1ll + 1ll * tmp / n + 1ll * (i <= tmp % n);
    printf("%lld ", x);
  }
  return 0;
}
