using namespace std;
#include <fstream>
#include <algorithm>
//#include <ctime>
//#include <cstdlib>
ifstream fin("algsort.in");
ofstream fout("algsort.out");

int v[500010];
int aux[500010];

void swap1(int, int) ;
void quick_sort(int, int) ;
int divide(int, int) ;
void merge_sort(int, int) ;
void interclasare(int, int, int, int) ;
void shell_sort(int, int) ;



int main()
{
    //srand(time(NULL));

    int i, n;
    fin>>n;
    for(i=0; i<n; ++i) fin>>v[i];
    /*for(i=0; i<n/2; ++i)
    {
        a=rand()%n; b=rand()%n;
        swap1(a, b);
    }*/
    sort(v, v+n);
    for(i=0; i<n; ++i) fout<<v[i]<<' ';
    return 0;
}

void swap1(int a, int b)
{
    int aux=v[a];
    v[a]=v[b];
    v[b]=aux;
}

void quick_sort(int p, int u)
{
    int m=divide(p, u);
    if(p<m-1) quick_sort(p, m-1);
    if(m+1<u) quick_sort(m+1, u);
}

int divide(int st, int dr)
{
    //int random = (rand())%((dr-st+1)) + st;
    int random = (st+dr)/2;
    swap1(random, st);
    int x=v[st];
    while(st<dr)
    {
        while(st<dr && v[dr]>=x) --dr;
        v[st]=v[dr];
        while(st<dr && v[st]<=x) ++st;
        v[dr]=v[st];
    }
    v[st]=x;
    return st;
}


void merge_sort(int st, int dr)
{
    int mijl=(st+dr)>>1;
    if(st<mijl) merge_sort(st, mijl);
    if(mijl+1<dr) merge_sort(mijl+1, dr);
    interclasare(st, mijl, mijl+1, dr);
}

void interclasare(int st1, int dr1, int st2, int dr2)
{
    if(v[dr1]<=v[st2]) return;
    int i, nr=0, init=st1;
    while(st1!=dr1+1 && st2!=dr2+1)
    {
        if(v[st1]<v[st2])
            aux[nr]=v[st1], ++st1;
        else aux[nr]=v[st2], ++st2;
        ++nr;
    }
    for(i=st1; i<=dr1; ++i) aux[nr++]=v[i];
    for(i=st2; i<=dr2; ++i) aux[nr++]=v[i];
    for(i=init; i<=dr2; ++i) v[i]=aux[i-init];
}


void shell_sort(int st, int dr)
{
    int i, n = dr-st+1, dif;
    for(dif = n/2; dif>=1; dif--)
    {
        for(i=st; i+dif<=dr; ++i)
            if(v[i]>v[i+dif])
                swap1(i, i+dif);
    }
}