algo. quick_sort

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] q = new int[n];
        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.print(q[i] + " ");
        }
    }
    
    public static void quick_sort(int[] q, int l, int r) {
        if (l >= r) return;
        
        int pivot = q[l + r >> 1];
        int i = l - 1, j = r + 1;
        
        while (i < j) {
            do i++; while (q[i] < pivot);
            do j--; while (q[j] > pivot);
            if (i < j) {
                int t = q[i];
                q[i] = q[j];
                q[j] = t;
            }
        }
        
        quick_sort(q, l, j);
        quick_sort(q, j+1, r);
    }
}