#include<iostream.h>
#include<fstream.h>
int main()
{long long a,i=0,n,j,aux;
ifstream f("algsort.in");
ofstream h("algsort.out");
struct nod{long long info;
nod*next;};
nod *p,*u,*c,*z;
f>>n;
f>>a;
p=new nod;
p->info=a;
u=p;
while(i<n)
{i++;
f>>a;
c=new nod;
c->info=a;
u->next=c;
u=c;}
u->next=0;
c=p;
while(c->next->next!=0)
{z=c->next;
while(z->next!=0)	
{
if(c->info>=z->info)
{aux=c->info;
c->info=z->info;
z->info=aux;}
z=z->next;
}c=c->next;}
c=p;
while(c->next!=0)
{h<<c->info<<" ";
c=c->next;}
return 0;}