#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
FILE *f=fopen("algsort.in","r");
FILE *g=fopen("algsort.out","w");
vector<long long>v;
long long n,x,i;
int main()
{
    fscanf(f,"%lld",&n);
    for(i=1;i<=n;i++)
     {
        fscanf(f,"%lld",&x);
        v.push_back(x);
     }
     sort(v.begin(),v.end());
     for(i=0;i<n;i++)
        fprintf(g,"%lld ",v[i]);
    return 0;
}