#include <stdio.h>

using namespace std;
int aux[500000];
void intercl (int v[], int st, int dr){
    int i, j, k, m=(st+dr)/2;
    i=k=st;
    j=m+1;
    while(i<=m and j<=dr){
        if(v[i]<v[j])
            aux[k++] = v[i++];
        else
            aux[k++] = v[j++];
        }
    while(i<=m)
        aux[k++] = v[i++];
    while(j<=dr)
        aux[k++] = v[j++];
    for(k=st; k<=dr; k++)
        v[k] = aux[k];
    }

void sortare (int v[], int st, int dr){
    if(st==dr) return;
    int m=(st+dr)/2;
    sortare(v, st, m);
    sortare(v, m+1, dr);
    intercl(v, st, dr);
    }
int main(){
    int n, v[500000];
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);
    scanf("%d ", &n);
    for(int i=1;i<=n;i++)
        scanf("%d ", &v[i]);
    sortare(v, 0, n);
    for(int i=1;i<=n;i++)
        printf("%d ", v[i]);
    return 0;
}