#include <bits/stdc++.h>
using namespace std;
void swap(int *a, int *b) {
  int x;
  x = *a;
  *a = *b;
  *b = x;
}
void merge(int *, int, int, int);
void mergesort(int *a, int low, int high) {
  int mid;
  if (low < high) {
    mid = (low + high) / 2;
    mergesort(a, low, mid);
    mergesort(a, mid + 1, high);
    merge(a, low, high, mid);
  }
  return;
}
void merge(int *a, int low, int high, int mid) {
  int i, j, k, c[102];
  i = low;
  k = low;
  j = mid + 1;
  while (i <= mid && j <= high) {
    if (a[i] < a[j]) {
      c[k] = a[i];
      k++;
      i++;
    } else {
      c[k] = a[j];
      k++;
      j++;
    }
  }
  while (i <= mid) {
    c[k] = a[i];
    k++;
    i++;
  }
  while (j <= high) {
    c[k] = a[j];
    k++;
    j++;
  }
  for (i = low; i < k; i++) {
    a[i] = c[i];
  }
}
int main() {
  int t;
  scanf("%d", &t);
  int arr[t], m = 0;
  for (int i = 0; i < t; i++) {
    scanf("%d", &arr[i]);
    if (m < arr[i]) m = arr[i];
  }
  mergesort(arr, 0, t - 1);
  for (int i = 0; i < t; i++) {
    printf("%d ", arr[i]);
  }
  return 0;
}
