#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool uax(T &x, T y) {
  return (y > x) ? x = y, true : false;
}
template <typename T>
inline bool uin(T &x, T y) {
  return (y < x) ? x = y, true : false;
}
template <typename T>
void kek(T ans) {
  cout << ans << endl;
  exit(0);
}
const int MOD = (int)1e9 + 7;
const long long INF = (long long)1e18 + 42;
int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n;
  cin >> n;
  vector<long long> a(n);
  long long sum = 0;
  for (auto &x : a) cin >> x, sum += x;
  long long x = (long long)n * (n - 1) / 2;
  vector<long long> ans(n, 1);
  if ((sum - x) % n) {
    ans[(sum - x) % n] = 0;
  }
  ans[0] = (sum - x + n - 1) / n;
  for (int i = 0; i < n; ++i) {
    if (i) ans[i] += ans[i - 1];
    cout << ans[i] << ' ';
  }
}
