import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {

    private static class FastScanner {
        private final BufferedReader reader;
        private StringTokenizer tokenizer;

        FastScanner(final InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return tokenizer.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
    }

    public static void QuickSort(int[] Array, int left, int right) {
        if (Array.length == 0)
            return;
        int middle = Array[left + (right - left) / 2];
        int i = left;
        int j = right;
        while (i <= j) {
            while (Array[i] < middle) {
                ++i;
            }
            while (Array[j] > middle) {
                j--;
            }
            if (i <= j) {
                int temp = Array[i];
                Array[i] = Array[j];
                Array[j] = temp;
                ++i;
                j--;
            }
        }
        if (left < j)
            QuickSort(Array, left, j);
        if (right > i)
            QuickSort(Array, i, right);
    }


    public static void main(String[] args) throws IOException {
        final FastScanner sc = new FastScanner(System.in);
        int n = sc.nextInt();
        int [] Array = new int[n];
        for (int i = 0; i < n; ++i)
            Array[i] = sc.nextInt();

        QuickSort(Array, 0, n-1);

        for (int i = 0; i < n; ++i)
            System.out.print(Array[i]+ " ");


    }
}