#include
using namespace std;
void merge(long long int *arr , long long int s ,long long int e){
long long int mid = (s+e)/2;
long long int i=s;
long long int j = mid+1;
long long int k=s;
long long int temp[10000];
while(i<=mid && j<=e){
if(arr[i]<arr[j]){
temp[k++]=arr[i++];
}else{
temp[k++]=arr[j++];
}
}
while(i<=mid){
temp[k++]=arr[i++];
}
while(j<=e){
temp[k++]=arr[j++];
}
for(i=s;i<=e;i++){
arr[i]=temp[i];
}
}
void mergesort(long long int *arr ,long long int s ,long long int e){
long long int mid = (s+e)/2;
mergesort(arr,s,mid);
mergesort(arr,mid+1,e);
merge(arr,s,e);
}
int main() {
long long int n;
cin>>n;
long long int arr[10000];
for(long long int i=0;i<n;i++){
cin>>arr[i];
}
mergesort(arr,0,n-1);
for(long long int i=0;i<n;i++){
cout<<arr[i]<<" ";
}
cout<<endl;
return 0;
}
