import java.util.Scanner;
import java.util.Arrays;


public class Main{
    public static void main(String[] agrs){
        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();
        }

        for(int i = 0;i < n; i ++ )
        {
            for(int j = i + 1; j < n; j ++ )
            {
                if(a[i] >a[j])
                {
                    int t = a[i];
                    a[i] = a[j];
                    a[j] = t;
                }
            }
        }


        for(int i = 0;i < n; i ++ )
        {
            System.out.printf("%d ",a[i]);
        }
    }
}
//最慢解法