#include <iostream>
#include <fstream>
using namespace std;
int quicksort(int v[], int left, int right){
    int i=left;
    int j=right;
    int temp,pivot=v[(left+right)/2];
    while(i<=j){
        while(v[i]<pivot)
            i++;
        while(v[j]>pivot)
            j--;
        if(i<=j){
            temp=v[i];
            v[i]=v[j];
            v[j]=temp;
            i++;
            j--;
        }
        if(left<j) quicksort(v , left , j);
        if(right>i) quicksort(v,i,right);
    }
}
int main()
{
    ifstream f("sortare.in");
    ofstream g("sortare.out");
    int n,i,v[100];
    f>>n;
    for(i=1;i<=n;i++)
        f>>v[i];
    quicksort(v , 1 , n);
    for(i=1;i<=n;i++)
        g<<v[i]<<' ';
    g<<'\n';
    return 0;
}