#include<iostream>
using namespace std;
void quick_sort(int a[],int left,int right) {
int i=left,j=right;
int basic=a[(left+right)/2];
while(i<=j) {
//从左到右找到大于等于基准点的元素
while(a[i]<basic) {
i++;
}
//从右到左找到小于等于基准点的元素
while(a[j]>basic) {
j--;
}
if(i<=j) {
swap(a[i],a[j]);
i++;
j--;
}
}
if(j>left)
quick_sort(a,left,j);
if(i<right)
quick_sort(a,i,right);
}
int main() {
int n,i;
int a[100];
cin>>n;
for(i=0;i<n;i++)
cin >> a[i];
quick_sort(a,0,n-1);
for(int j=0;j<n;j++)
cout<<a[j]<<" ";
return 0;
}