#include<iostream>
using namespace std;
const int N = 100000;
void quicksort(int a[], int left, int right) {
if (left >=right)
return;
int p = a[left+right+1>>1], i = left-1, j = right+1;
while (i < j) {
do i++; while (a[i] < p);
do j--; while (a[j] > p);
if (i < j) swap(a[i], a[j]);
}
quicksort(a, left, j);
quicksort(a, j +1, right);
}
int main() {
int n;
scanf("%d",&n);
int a[N];
for (int i = 0; i < n; i++)
scanf("%d",&a[i]);
quicksort(a, 0, n - 1);
for (int i = 0; i < n; i++)
printf("%d ",a[i]);
return 0;
}