#include <fstream>
#include <iostream>
using namespace std;

void inter_clasare(int a[], int left, int right)
{
    int i,j,k=0,b[250000],m=(left+right)/2;
    for(i=0;i<m;i++)
        b[i]=a[i];
    i=0;
    j=m;
    while((i<m)&&(j<=right))
        a[k++]=(b[i]<a[j]) ? b[i++] : a[j++];
    while(i<m)
        a[k++]=b[i++];
}

void merge_sort(int a[],int left, int right)
{
    int m=(left+right)/2;
    if(right-left>=1)
    {
        merge_sort(a,left,m);
        merge_sort(a,m+1,right);
    }
    inter_clasare(a,left,right);
}

int main()
{
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    int n, a[500000],i;
    f>>n;
    for(i=0;i<n;i++)
        f>>a[i];
    merge_sort(a,0,n-1);
    for(i=0;i<n;i++)
        g<<a[i]<<' ';
    return 0;
}