/*#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <float.h>
#include <string.h>
#include <algorithm>

#define NMax (int)5e5 + 5

int N;
int v[NMax];

int comp(void *a,void *b) {
    int x = *((int*)a);
    int y = *((int*)b);

    if (x < y) {
        return -1;
    }
    if (x > y) {
        return 1;
    }
}
void swap (void *a ,void *b )

{
    int i ;
    for(i=0;i<4 ;++i)
    {
        char aux=*(char*)(a+i);
        *(char*)(a+i)=*(char*)(b+i);
        *(char*)(b+i)=aux;
    }
}

 void psort(int *v,int n , int s , int (*comp)(void* , void *))
{
    int i,j;
    for(i=0;i<n-1;++i)
        for(j=i+1;j<n;++j)
        if(comp(v+(i*s),v+(j*s)))
        swap(v+(i*s),v+(j*s));
}
int main()
{
    FILE *f = fopen("algsort.in","r");
    FILE *g = fopen("algsort.out","w");

    fscanf(f,"%d",&N);
    int i;
    for (i=1;i <= N;++i) {
        fscanf(f,"%d",v+i);
    }

    psort(v+1,N,4,comp());

    for (i=1;i <= N;++i) {
        fprintf(g,"%d ",v[i]);
    }

    fclose(f);fclose(g);
    return 0;
}
*/
//am incercat sa fac eu qsortul , dar nu e o idee buna :))
#include <stdio.h>
#include <stdlib.h>

int N;
int v[500005];

int comp(void *a,void *b) {
    int x = *((int*)a);
    int y = *((int*)b);

    if (x < y) {
        return -1;
    }
    if (x > y) {
        return 1;
    }
    return 0;
}



int main()
{
    FILE *f = fopen("algsort.in","r");
    FILE *g = fopen("algsort.out","w");

    fscanf(f,"%d",&N);
    int i;
    for (i=1;i <= N;++i) {
        fscanf(f,"%d",v+i);
    }

    qsort(v+1,N,4,comp);

    for (i=1;i <= N;++i) {
        fprintf(g,"%d ",v[i]);
    }

    return 0;
}