#include<bits/stdc++.h>
using namespace std;
void slow_sort(int* arr, int left, int right){
if(left >= right) return;
int middle = (left + right)/2;
slow_sort(arr, left, middle);
slow_sort(arr, middle + 1, right);
if(arr[middle] < arr[right]) swap(arr[middle], arr[right]);
slow_sort(arr, left, right - 1);
}
bool isSorted(int* arr, int length){
for(int i = 1; i < length; i++){
if(arr[i - 1] < arr[i]) return 0;
}
return 1;
}
int n, arr[10000];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 0; i < n; i++) cin >> arr[i];
while(!isSorted(arr, n)){
slow_sort(arr, 0, n - 1);
}
for(int i = 0; i < n; i++) cout << arr[i] << ' ';
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnZvaWQgc2xvd19zb3J0KGludCogYXJyLCBpbnQgbGVmdCwgaW50IHJpZ2h0KXsKICAgIGlmKGxlZnQgPj0gcmlnaHQpIHJldHVybjsKICAgIGludCBtaWRkbGUgPSAobGVmdCArIHJpZ2h0KS8yOwoKICAgIHNsb3dfc29ydChhcnIsIGxlZnQsIG1pZGRsZSk7CiAgICBzbG93X3NvcnQoYXJyLCBtaWRkbGUgKyAxLCByaWdodCk7CgogICAgaWYoYXJyW21pZGRsZV0gPCBhcnJbcmlnaHRdKSBzd2FwKGFyclttaWRkbGVdLCBhcnJbcmlnaHRdKTsKCiAgICBzbG93X3NvcnQoYXJyLCBsZWZ0LCByaWdodCAtIDEpOwp9Cgpib29sIGlzU29ydGVkKGludCogYXJyLCBpbnQgbGVuZ3RoKXsKICAgIGZvcihpbnQgaSA9IDE7IGkgPCBsZW5ndGg7IGkrKyl7CiAgICAgICAgaWYoYXJyW2kgLSAxXSA8IGFycltpXSkgcmV0dXJuIDA7CiAgICB9CgogICAgcmV0dXJuIDE7Cn0KCmludCBuLCBhcnJbMTAwMDBdOwoKaW50IG1haW4oKXsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7CiAgICBjaW4udGllKDApOyBjb3V0LnRpZSgwKTsKCiAgICBjaW4gPj4gbjsKICAgIGZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspIGNpbiA+PiBhcnJbaV07CgogICAgd2hpbGUoIWlzU29ydGVkKGFyciwgbikpewogICAgICAgIHNsb3dfc29ydChhcnIsIDAsIG4gLSAxKTsKICAgIH0KCiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSBjb3V0IDw8IGFycltpXSA8PCAnICc7CgogICAgcmV0dXJuIDA7Cn0K