#include <bits/stdc++.h>

using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");

const int NMax = 500001;

int a[NMax];
int n;

int main()
{
    f >> n;
    srand(time(NULL));
    for(int i = 1; i <= n; ++i){
        f >> a[i];
    }
    sort(a + 1, a + 1 + n);
    for(int i = 1; i <= n; ++i){
        g << a[i] << ' ';
    }
    return 0;
}