import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int[] a=new int[n];
for (int i = 0; i < n; i++) {
a[i]=sc.nextInt();
}
quicksort(a,0, a.length-1);
for (int i : a) {
System.out.print(i+” “);
}
}
public static void quicksort(int[] a,int l,int r){
int i=l-1;
int j=r+1;
int temp;
int x=a[(l+r)/2];
if (l>=r){
return;
}
while (i<j){
do {
i++;
}while (a[i]<x);
do {
j--;
}while (a[j]>x);
if (i<j){
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
quicksort(a,l,j);
quicksort(a,j+1,r);
}
}