#include <cstdio>
#include <vector>
#include <algorithm>
#define FIN "algsort.in","r",stdin
#define FOUT "algsort.out","w",stdout

using namespace std;

int n,i,x;
vector<int>G;
vector<int>::iterator it;

int main()
{
    freopen(FIN);
    freopen(FOUT);

    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        G.push_back(x);
    }
    sort(G.begin(),G.end());
    for(it=G.begin(); it!=G.end(); ++it)
        printf("%d ",(*it));
    return 0;
}