#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <vector>
#include <stdlib.h>
using namespace std;
std::vector< int > a;
int n,x;
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;++i)
    {
        scanf("%d",&x);
        a.push_back(x);
    }
    sort(a.begin(),a.end());
    for(std::vector< int >::iterator it=a.begin();it!=a.end();++it)printf("%d ",*it);
    return 0;
}