#include <fstream>
using namespace std;
int n, i, v[100];

ifstream fin("algsort.in");
ofstream fout("algsort.out");

void interclaseaza(int st, int mid, int dr){
    int w[100];
    int k = st-1;
    int i = st;
    int j = mid+1;
    while(i <= mid && j <= dr){
        if(v[i] < v[j]){
            k++;
            w[k] = v[i];
            i++;
        }else{
            k++;
            w[k] = v[j];
            j++;
        }
    }
    for(;i<=mid;i++){
        w[++k] = v[i];
    }
    for(;j<=dr;j++){
        w[++k] = v[j];
    }
    for(i=st;i<=dr;i++){
        v[i] = w[i];
    }
}

void sorteaza(int st, int dr){
    if(st < dr){
        int mid = (st+dr)/2;
        sorteaza(st, mid);
        sorteaza(mid+1, dr);
        interclaseaza(st, mid, dr);
    }
}

int main(){
    fin>>n;
    for(i=1;i<=n;i++){
        fin>>v[i];
    }
    sorteaza(1, n);
    for(i=1;i<=n;i++){
        fout<<v[i]<<" ";
    }
}