#define IA_PROB "algsort"

#include <cassert>
#include <cstdio>
#include <cstring>

#include <iostream>
#include <fstream>

#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>

#include <algorithm>

using namespace std;

int int_cmp(const void *a, const void *b)
{
	return (*(int*)a < *(int*)b) ? -1 : 1;
}

int main()
{
	freopen(IA_PROB".in", "r", stdin);
	freopen(IA_PROB".out", "w", stdout);

	int n;
    scanf("%d", &n);
    assert(n > 0);

    int *v = (int*)malloc(n * sizeof(int));
    for (int i = 0; i < n; i++) {
    	scanf("%d", &v[i]);
    }

    qsort(v, n, sizeof(int), int_cmp);

    for (int i = 0; i < n; i++) {
		printf("%d ", v[i]);
	}

    return 0;
}