//#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <bitset>
#include <limits>
#include <fstream>
#include <cstring>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");

#define nmax 500010
#define mod 1000007
#define mp make_pair
#define pb push_back
#define int64 long long
#define pii pair<int,int>
#define inf numeric_limits<int>::max()
#define forv(v,it) for (vector<int>::iterator it=v.begin();it!=v.end();it++)

int n,v[nmax],a[nmax],b[nmax];

void meSort(int st,int dr)
{
    int mij,len1,len2,i,j,k;
    if (st<dr)
    {
        mij=(st+dr)/2;
        meSort(st,mij);
        meSort(mij+1,dr);
        len1=mij-st+1;len2=dr-mij;
        for (i=1;i<=len1;i++) a[i]=v[st+i-1];
        for (j=1;j<=len2;j++) b[j]=v[mij+j];
        i=j=1;k=st;
        while (i<=len1 && j<=len2)
        {
            if (a[i]<b[j]) v[k]=a[i],i++,k++;
            else v[k]=b[j],j++,k++;
        }
        while (i<=len1) v[k]=a[i],i++,k++;
        while (j<=len2) v[k]=b[j],j++,k++;
    }
}

int main()
{
    int i,j;
    cin>>n;
    for (i=1;i<=n;i++) cin>>v[i];
    meSort(1,n);
    for (i=1;i<=n;i++) cout<<v[i]<<" ";
}