#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

vector <int> S;


int main()
{
    int N,x;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d\n",&N);
    for(int i=0;i<N;++i)
    {
        scanf("%d",&x);
        S.push_back(x);
    }
    sort(S.begin(),S.end());
    for(int i=0;i<S.size();++i)
        printf("%d ",S[i]);
    return 0;
}