#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);
    vector <int> q;
    int n, x;
    for (scanf("%d", &n);  n--; scanf("%d", &x), q.push_back(x));
    sort(q.begin(), q.end());
    for (vector <int>::iterator it=q.begin(); it!=q.end(); printf("%d ", *it), it++);
    return 0;
}