#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[n], maxi = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    maxi = max(maxi, a[i]);
  }
  int m[maxi][n];
  for (int i = 0; i < maxi; i++) {
    for (int j = 0; j < n; j++) {
      m[i][j] = 0;
    }
  }
  for (int j = 0; j < n; j++) {
    int i = maxi - 1, cou = a[j];
    while (cou > 0) {
      m[i][j] = 1;
      i--;
      cou--;
    }
  }
  for (int i = 0; i < maxi; i++) sort(m[i], m[i] + n);
  for (int i = 0; i < n; i++) {
    int count = 0;
    for (int j = 0; j < maxi; j++) {
      if (m[j][i] == 1) count++;
    }
    cout << count << " ";
  }
  return 0;
}
