#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

int n; vector<int> v;

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

    int t;
    scanf("%d\n", &n);
    for(int i=0; i<n; i++){
        scanf("%d ", &t);
        v.push_back(t);
    }
    sort(v.begin(), v.end());
    for(int i=0; i<n; i++)
        printf("%d ", v[i]);

    return 0;
}