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

using namespace std;
int i,j,k,l,m,n;
int a[500000];
FILE *in,*out;

bool sor(int x, int y)
{
    if (x<y) return true; else return false;
}

int main()
{
    in=fopen("algsort.in","r");
    fscanf(in,"%d",&n);
        for (i=0; i<n; i++)
        fscanf(in,"%d",&a[i]);
    fclose(in);
    sort(&a[0],&a[n],sor);
    out=fopen("algsort.out","w");
        for (i=0; i<n; i++)
        fprintf(out,"%d ",a[i]);
    fclose(out);
    return 0;
}