#include<fstream>
#include<iostream>
#include<climits>
#include<algorithm>
#include<cstring>
#include<cmath>
#include <vector>
#include <queue>
#include <iomanip>
#include <bitset>
#include <deque>

#define DIM 500000

using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

//ifstream f("in.in");
//ofstream g("out.out");

int n,v[DIM+5],u[DIM+5];

void sorteaza(int start,int endd){
    if(start<endd){
        int mid = (start+endd)/2;
        sorteaza(start,mid);
        sorteaza(mid+1,endd);

        int i=start,j=mid+1,k=0;
        while(i<=mid && j<=endd){
            if(v[i]<v[j]){
                u[++k] = v[i++];
            }else{
                u[++k] = v[j++];
            }
        }

        for(;i<=mid;){
            u[++k] = v[i++];
        }
        for(;j<=endd;){
            u[++k] = v[j++];
        }

        for(int l1=1,l2=start;l2<=endd;l1++,l2++){
            v[l2] = u[l1];
        }
    }
}


int main(){

    f>>n;
    for(int i=1;i<=n;i++){
        f>>v[i];
    }

    sorteaza(1,n);

    for(int i=1;i<=n;i++){
        g<<v[i]<<" ";
    }

    f.close();
    g.close();
    return 0;
}