#include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 1e6 + 100;
struct IO {
 private:
  static constexpr int ibufsiz = 1 << 20;
  char ibuf[ibufsiz + 1], *inow = ibuf, *ied = ibuf;
  static constexpr int obufsiz = 1 << 20;
  char obuf[obufsiz + 1], *onow = obuf;
  const char *oed = obuf + obufsiz;

 public:
  char getchar() {
    if (inow == ied) {
      ied = ibuf + sizeof(char) * fread(ibuf, sizeof(char), ibufsiz, stdin);
      *ied = '\0';
      inow = ibuf;
    }
    return *inow++;
  }
  template <typename T>
  void read(T &x) {
    static bool flg;
    flg = 0;
    x = 0;
    char c = getchar();
    while (!isdigit(c)) flg = c == '-' ? 1 : flg, c = getchar();
    while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
    if (flg) x = -x;
  }
  template <typename T, typename... Y>
  void read(T &x, Y &...X) {
    read(x);
    read(X...);
  }
  int readi() {
    static int res;
    read(res);
    return res;
  }
  long long readll() {
    static long long res;
    read(res);
    return res;
  }
  void flush() {
    fwrite(obuf, sizeof(char), onow - obuf, stdout);
    fflush(stdout);
    onow = obuf;
  }
  void putchar(const char c) {
    *onow++ = c;
    if (onow == oed) {
      fwrite(obuf, sizeof(char), obufsiz, stdout);
      onow = obuf;
    }
  }
  template <typename T>
  void write(T x, const char split = '\0') {
    static unsigned char buf[32];
    if (x < 0) putchar('-'), x = -x;
    int p = 0;
    do {
      buf[++p] = x % 10;
      x /= 10;
    } while (x);
    for (int i = p; i >= 1; i--) putchar(buf[i] + '0');
    if (split != '\0') putchar(split);
  }
  void puts(char const *str, const char split = '\n') {
    while (*str) putchar(*(str++));
    putchar(split);
  }
  void lf() { putchar('\n'); }
  ~IO() { fwrite(obuf, sizeof(char), onow - obuf, stdout); }
} io;
int n;
long long val[maxn], ans[maxn], sum;
bool chk(const long long beg) {
  return (((beg + beg + n - 1) * n) >> 1) <= sum;
}
int main() {
  io.read(n);
  for (int i = 1; i <= n; i++) io.read(val[i]);
  for (int i = 1; i <= n; i++) sum += val[i];
  long long l = 0, r = 1e12;
  while (l <= r) {
    const long long mid = l + ((r - l) >> 1);
    if (chk(mid))
      l = mid + 1, ans[1] = mid;
    else
      r = mid - 1;
  }
  for (int i = 2; i <= n; i++) ans[i] = ans[i - 1] + 1;
  for (int i = 1; i <= n; i++) sum -= ans[i];
  for (int i = 1; i <= sum; i++) ans[i]++;
  for (int i = 1; i <= n; i++) printf("%lld ", ans[i]);
  puts("");
  return 0;
}
