#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "apm"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		//freopen("test.out","w",stdout);
	}
}

#define MAX 500002
#define INF 0xffffff

int n,a[MAX];

void qsort(int l,int r)
{
	int p=(l+r)/2,i=l,j=r;
	while(i < j)
	{
		while( a[i] < p )i++;
		while( a[j] > p )j--;
		if( i<=j )
		{
			swap(a[i],a[j]);
			i++;
			j--;
		}
	}
	if( i<r )qsort(i,r);
	if( j>l )qsort(l,j);
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);
	// start
		scanf("%d",&n);
		for(int i=1;i<=n;i++)scanf("%d",&a[i]);
		qsort(1,n);
		for(int i=1;i<=n;i++)printf("%d ",a[i]);
	return 0;
}