#include <iostream>
#include <cstdio>
#define MaxN 500005
using namespace std;


int s[]={5,4,3,2,1,0};
int Part(int *v,int st,int dr)
{
    int index=st,piv=v[dr];
    for(int i=st;i<=dr;i++)
    {
        if(v[i]<=piv)
            swap(v[index++],v[i]);
    }
    return index-1;
}
void QuickSort(int *v,int st,int dr)
{
    if(st<dr)
    {
        int index=Part(v,st,dr);
        QuickSort(v,st,index-1);
        QuickSort(v,index+1,dr);
    }
}

FILE *IN,*OUT;

int main()
{
    int N,v[MaxN];
    IN=fopen("algsort.in","r");
    OUT=fopen("algsort.out","w");
    for(int i=1;i<=N;i++)
        fscanf(IN,"%d",&v[i]);
    QuickSort(v,1,N);
    for(int i=1;i<=N;i++)
        fprintf(OUT,"%d ",v[i]);
    return 0;
}