#include<fstream>
#include <iostream>
#include<cstdlib>
#include <ctime>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int k, v[3000001];
int hoare(int a[],int p,int r)
{
    int pivot= a[p+(rand()%(r-p+1))],i,j;
    i=p-1;
    j=r+1;
    while(true){
        do{
            ++i;
        }while(a[i]<pivot);
        do{
            --j;
        }while(a[j]>pivot);
        if(i>=j)return j;

        int aux=a[i];
        a[i]=a[j];
        a[j]=aux;
    }
}
void quicksort(int a[],int p,int r){
    if(p<r){
        int q=hoare(a,p,r);

        quicksort(a,p,q);
        quicksort(a,q+1,r);}
    }

int main()
{srand(time(0));
    int i,n;
    f>>n;
    for(i=1;i<=n;i++)
        f>>v[i];
    quicksort(v,1,n);
   for(i=1;i<=n;i++)
        g<<v[i];
    return 0;
}