import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner reader = new Scanner(System.in);
        int n = reader.nextInt();
        int [] arr =new int[n];
        for (int i = 0; i < arr.length;i++)
            arr[i] = reader.nextInt();
        quick_sort(arr,0,arr.length - 1);
        for (int i = 0;i < arr.length;i++)
            System.out.printf("%d ",arr[i]);

    }
    public static void quick_sort(int[] arr,int st,int ed){
        if(st >= ed)return;
        int empty = st;
        int mid = arr[st],i = st,j = ed;
        while (i < j){
            while (arr[j] >= mid && j > i)j--;
            if(i < j){
                arr[i] = arr[j];
                i++;
            }
            while (arr[i] <= mid && i < j)i++;
            if(i < j){
                arr[j] = arr[i];
                j--;
            }
        }
        arr[i] = mid;

        quick_sort(arr, st, i - 1);
        quick_sort(arr,i + 1,ed);
    }
}