#include<bits/stdc++.h>
using namespace std;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
int partition(vector<int> arr, int b, int e, int p){
int pi = b;
for(int i = b; i <= e; i++){
if(arr[i] <= p){
swap(arr[i], arr[pi]);
pi++;
}
}
return pi--;
}
void quicksort(vector<int> arr, int b, int e){
if(b<e){
int p = arr[e];
int pi = partition(arr, b , e, p);
quicksort(arr, b , pi-1);
quicksort(arr, pi, e);
}
}
int main(){
int x;
cin >> x;
vector<int> t;
int o;
for (int i = 0; i < x; i++){
cin >> o;
t.push_back(o);
}
quicksort(t, 0, x-1);
for (int i = 0; i < x; i++){
cout << t[i] << " ";
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnR5cGVkZWYgbG9uZyBpbnQgaW50MzI7CnR5cGVkZWYgdW5zaWduZWQgbG9uZyBpbnQgdWludDMyOwp0eXBlZGVmIGxvbmcgbG9uZyBpbnQgaW50NjQ7CnR5cGVkZWYgdW5zaWduZWQgbG9uZyBsb25nIGludCAgdWludDY0OwoKaW50IHBhcnRpdGlvbih2ZWN0b3I8aW50PiBhcnIsIGludCBiLCBpbnQgZSwgaW50IHApewoKICAgIGludCBwaSA9IGI7CgogICAgZm9yKGludCBpID0gYjsgaSA8PSBlOyBpKyspewogICAgICAgIGlmKGFycltpXSA8PSBwKXsKICAgICAgICAgICAgc3dhcChhcnJbaV0sIGFycltwaV0pOwogICAgICAgICAgICBwaSsrOwogICAgICAgIH0KICAgIH0KICAgIHJldHVybiBwaS0tOwp9Cgp2b2lkIHF1aWNrc29ydCh2ZWN0b3I8aW50PiBhcnIsIGludCBiLCBpbnQgZSl7CiAgICAKICAgIGlmKGI8ZSl7CiAgICAgICAgaW50IHAgPSBhcnJbZV07CiAgICAgICAgaW50IHBpID0gcGFydGl0aW9uKGFyciwgYiAsIGUsIHApOwoKICAgICAgICBxdWlja3NvcnQoYXJyLCBiICwgcGktMSk7CiAgICAgICAgcXVpY2tzb3J0KGFyciwgcGksIGUpOwogICAgfQoKfQoKaW50IG1haW4oKXsKICAgIGludCB4OwogICAgY2luID4+IHg7CiAgICB2ZWN0b3I8aW50PiB0OwogICAgaW50IG87IAogICAgZm9yIChpbnQgaSA9IDA7IGkgPCB4OyBpKyspeyAgCiAgICAgICAgY2luID4+IG87ICAKICAgICAgICB0LnB1c2hfYmFjayhvKTsKICAgIH0KICAgIHF1aWNrc29ydCh0LCAwLCB4LTEpOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCB4OyBpKyspeyAgICAKICAgICAgICAgIGNvdXQgPDwgdFtpXSA8PCAiICI7CiAgICB9CiAgICByZXR1cm4gMDsKfQ==