2022-01-07

import java.util.Scanner;
public class Main{
    static int N = 1000010;
    static int[] q = new int[N];
    public static void quick_sort(int[] q,int l,int r){
        if(l >= r) return ;
        int x = q[l];
        int i = l - 1;
        int j = r + 1;
        while(i < j){
            do i++; while(x > q[i]);
            do j--; while(x < q[j]);
            if(i < j) {
                int temp = q[i];
                q[i] = q[j];
                q[j] = temp;
            }
        }
        quick_sort(q,l,j);
        quick_sort(q,j + 1,r);
    }
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        for(int i = 0;i < n; i++)
            q[i] = sc.nextInt();
        quick_sort(q,0,n - 1);
        for(int i = 0; i < n; i++)
            System.out.printf("%d ",q[i]);
    }
}