import java.io.*;


class csort {

    public static void main(String[] arg) throws IOException {

	BufferedReader stdin = 
	    new BufferedReader(new InputStreamReader(System.in));
	int[] L = new int[100], C = new int[50];
	int i, j, n, max, pos;


		//  Read in list L

	System.out.println("Number of elements?");
	n = Integer.parseInt(stdin.readLine());

        System.out.println("Enter list:");
	for (i = 1; i <= n; i++) {
	    L[i] = Integer.parseInt(stdin.readLine());
	}
	    
		// Find maximum value in list L

	max = 0;
	for (i = 1; i <= n; i = i + 1) {
	    if (L[i] > max) {
		max = L[i];
	    }
	}

		// Count-sort algorithm

	for (i = 1; i <= max; i = i + 1) {
	    C[i] = 0;
	}
	for (i = 1; i <= n; i = i + 1) {
	    C[L[i]] = C[L[i]] + 1;
	}
	pos = 1;
	for (i = 1; i <= max; i = i + 1) {
	    for (j = 1; j <= C[i]; j = j + 1) {
		L[pos] = i;
		pos = pos + 1;
	    }
	}
       
		// Print out sorted version of list L

	System.out.println("Sorted list:");
	for (i = 1; i <= n; i = i + 1) {
	    System.out.println(L[i]);
	}

    }  // End of main method

}  // End of class csort