#include <iostream>
#include <algorithm>
#include <stdio.h>

using namespace std;
int unsigned v[500002],n,i;
FILE *fin=fopen("algsort.in","r"),   *fout=fopen("algsort.out","w");

bool verif(int a, int b){
return(a<b);
}

int main()
{
    fscanf(fin,"%d\n",&n);
    for(i=0;i<n;i++)
    {
        fscanf(fin,"%d ",&v[i]);
    }
    sort(v,v+n,verif);
    for(i=0;i<n-1;i++)
    {
    fprintf(fout,"%d ",v[i]);
    }
    fclose(fout);
}