#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f,*g;
int v[500002];
int main()
{
    int n,i,t,aux;
    bool s;
    f=fopen("algsort.in","r");
    g=fopen("algsort.out","w");
    fscanf(f,"%d ",&n);
    for(i=1;i<=n;i++)
    {
        fscanf(f,"%d ",&v[i]);
    }
    sort(v+1,v+n+1);
    for(i=1;i<=n;i++)
    {
        fprintf(g,"%d ",v[i]);
    }
    return 0;
}