#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
int a[1000010];
void qsort(int x,int y){
	int i=x,j=y,t;
	int k=a[(x+y)/2];
	while(i<=j){
		while(a[i]>k)j--;
		while(a[i]<k)i++;
		if(i<=j){
			swap(a[i],a[j]);
			i++;
			j--;
		}
	}if(x<j)qsort(x,j);
	if(y>i)qsort(i,y);
	return;
}int main(){
	int n;
	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;
}