#include <bits/stdc++.h>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,v[500001],aux[500001];

void mergesort(int st, int dr){
    if(st == dr)
        return;

    int mid = (st+dr)/2;
    mergesort(st,mid);
    mergesort(mid+1,dr);
    int i=st,j=mid+1,k=st;
    while(i<=mid && j<=dr){
        if(v[i] < v[j])
            aux[k++] = v[i++];
        else
            aux[k++] = v[j++];
    }
    while(i<=mid){
        aux[k++] = v[i++];
    }
    while(j<=dr){
        aux[k++] = v[j++];
    }
    for(i=st;i<=dr;i++)
        v[i] = aux[i];
}

int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    mergesort(1,n);
    for(int i=1;i<=n;i++)
        fout<<v[i]<<' ';
    return 0;
}