#include<stdio.h>
#include<stdlib.h>

#define MAXN 50

int n;
int seq[MAXN];
int next[MAXN];
int med[MAXN];

int b[MAXN];

void merge(int f, int s, int e) {
  int i = f, j = s, k;

  k = f;
  while (i < s && j < e) {
    if (seq[j] > seq[i]) b[k++] = seq[j++];
    else b[k++] = seq[i++];
  }
  while (i < s) b[k++] = seq[i++];
  while (j < e) b[k++] = seq[j++];
  for (k=f; k<e; k++)
    seq[k] = b[k];
}


int main() {
  int i, a, done;

  scanf("%d", &n);
  for (i=0; i<n; i++) {
    scanf("%d", &seq[i]);
    seq[i] -= i;
  }

  a = 0;
  i = 1;
  while (a < n) {
    while (i < n && seq[i] <= seq[i-1]) i++;
    next[a] = i;
    med[a] = seq[(a+i)/2];
    a = i++;
  }

  done = 0;
  while (!done) {
    done = 1;
    i = 0;
    while (next[i] < n) {
      if (med[i] > med[next[i]]) {
	merge(i, next[i], next[next[i]]);
	next[i] = next[next[i]];
	med[i] = seq[(i+next[i])/2];
	done = 0;
      }
      i = next[i];
    }
  }
  
  a = 0;
  while (a < n) {
    for (i = a; i<next[a]; i++)
      printf("%d ", med[a]+i);
    a = next[a];
  }
  printf("\n");
  
  return 0;
}