#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int n;
int q[N], temp[N];
void merge_sort(int* q, int l, int r){
if( l >= r) return ;
int mid = (l + r) >> 1;
merge_sort(q, l, mid),merge_sort(q, mid + 1, r);
int i = l, j = mid + 1, k = 0;
while(i <= mid && j <= r){
if(q[i] <= q[j]) temp[k++ ] = q[i++ ];
else temp[k++ ] = q[j++ ];
}
while(i <= mid) temp[k++ ] = q[i++ ];
while(j <= r) temp[k++ ] = q[j++ ];//j++ ,而不是 i++
for(int i = l, j = 0;i <= r; i++, j++) q[i] = temp[j];//i <= r, 而不是i < r
}
int main(){
ios::sync_with_stdio(false);//false写错
cin.tie(nullptr);
cin>>n;
for(int i = 0; i < n; i++) cin>>q[i];
merge_sort(q, 0, n - 1);
for(int i = 0; i < n; i++) cout<<q[i]<<" ";
return 0;
}