#include <cstdio>
#include <cstring>
#define MaxN 500005
#define MaxD 100000
#define MAX 131072
using namespace std;

FILE *IN,*OUT;

char f[MAX];
int pos=0,fr[MaxD],v[MaxN],aux[MaxN],N,Max=0,Log;
inline void Sort()
{
	int Div=1,Size=1;
	Log=0;
	while(Size<Max)
		Log++,Size*=MaxD;//ma uit sa vad de cate ori trebuie sa fac o operatie
	for(int i=1;i<=Log;i++)
	{
		memset(fr,0,sizeof fr);
		for(int i=1;i<=N;i++)
			fr[(v[i]/Div)%MaxD]++;
		for(int i=1;i<MaxD;i++)
			fr[i]+=fr[i-1];
		for(int i=N;i>0;i--)
			aux[fr[(v[i]/Div)%MaxD]--]=v[i];
		memcpy(v,aux,sizeof v);
		Div*=MaxD;
	}
}
inline void Read(int &nr)
{
    nr=0;
    while(f[pos]<'0'||f[pos]>'9')
    {
        pos++;
        if(pos==MAX)
            fread(f,MAX,1,IN),pos=0;
    }
    while(f[pos]>='0'&&f[pos]<='9')
    {
        nr=10*nr+f[pos++]-'0';
        if(pos==MAX)
            fread(f,MAX,1,IN),pos=0;
    }
}
int main()
{
	IN=fopen("algsort.in","r");
    OUT=fopen("algsort.out","w");
	Read(N);
	for(int i=1;i<=N;i++)
	{
		Read(v[i]);
		if(Max<v[i])
			Max=v[i];
	}
	Sort();
	for(int i=1;i<=N;i++)
		fprintf(OUT,"%d ",v[i]);
	return 0;
}