#include<bits/stdc++.h>
using namespace std;
#define pzq(a,b,c) for(int a=b;a<c;a++)
#define maxn 1100
void qsort(int a[],int l,int r){
	int i=l,j=r,flag=a[(l+r)/2],tmp;
	do{
		while(a[i]<flag)i++;
		while(a[j]>flag)j--;
		if(i<=j){
			tmp=a[i];a[i]=a[j];a[j]=tmp;
			i++;j--;
		}
	}while(i<=j);
	if(l<j)qsort(a,l,j);
	if(i<r)qsort(a,i,r);
}
int main(){
    int n,a[maxn];
    cin>>n;
    pzq(i,0,n){
    	cin>>a[i];
	}
	qsort(a,0,n-1);
	pzq(i,0,n-1){
		cout<<a[i]<<" ";
	}
	cout<<a[n-1]<<endl;
    return 0;
}