#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define endl '\n'
#define all(a) (a).begin(),(a).end()
using namespace std;
const ll maxn = 1e5 + 5;


ifstream fin("algsort.in");
ofstream fout("algsort.out");

ll partition(vector<ll>& a, ll low, ll high) {
    ll pivot = a[low];
    ll i = low - 1;
    ll j = high + 1;
    while (1) {
        i++;
        while (a[i] < pivot) {
            i++;
        }
        j--;
        while (a[j] > pivot) {
            j--;
        }
        if (i >= j) {
            return j;
        }
        swap(a[i], a[j]);
    }
}

void quick_sort(vector<ll>& a, ll low, ll high) {
    if (low >= high) {
        return;
    }
    ll pivot = partition(a, low, high);
    quick_sort(a, pivot + 1, high);
    quick_sort(a, low, pivot); 
}

void solve() {
    ll n;
    fin >> n;
    vector<ll> a(n);
    for (ll i = 0; i < n; i++) {
        fin >> a[i];
    }
    quick_sort(a, 0, n - 1);
    for (ll i = 0; i < n; i++) {
        fout << a[i] << " ";
    }
    fout << endl;
}
 
int main() {
    ll t = 1;
    // fin >> t;
    while (t--) {
        solve();
    }
    return 0;
}