#include <bits/stdc++.h>
using namespace std;
bitset<200000> vis(0);
vector<bool> prime(1e6, true);
void primes() {
  prime[0] = 0;
  prime[1] = 0;
  for (long long int i = 2; i * i <= 1e6; i++) {
    if (prime[i]) {
      for (long long int j = (i * i); j <= 1e6; j += i) {
        prime[j] = false;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int n;
  cin >> n;
  vector<long long int> a(n, 0);
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long int dif = 0;
  for (long long int i = 0; i < n; i++) {
    dif += (a[i] - 1 - i);
    a[i] = (i + 1);
  }
  long long int k = dif / n;
  for (long long int i = 0; i < n; i++) {
    a[i] += k;
  }
  for (long long int i = 0; i < (dif % n); i++) {
    a[i]++;
  }
  for (long long int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << "\n";
}
