public class MergeSort extends MiniJava {
    public static List readList(int number) {
        // number = Anzahl zu lesender Elemente
        List res = null;
        for (int i = 0; i < number; ++i) {
            int x = read();
            res   = new List(x,res);
        }
        return res;
    }
   
    public static int[] sort(int[] a) {

    } // end of sort()

    public static String arrayToString(int[] a) {
        if (a.length == 0) return "[]";
        String res = "[" + a[0];
        for (int i=1; i<a.length; ++i) {
            res += ", " + a[i];
        }
        res += "]";
        return res;
    }
    
    // Jetzt kommt das Hauptprogramm
    public static void main(String[] args) {
        int n = read();
        int[] a = readArray(n);
        a = sort(a);
        write(arrayToString(a));
    } // end of main()    
}