#include <fstream>
#include <set>
#include <vector>
#include <random>
#include <chrono>
#include <cmath>
#include <queue>
#include <map>
#define pb push_back
#define int long long
using namespace std;
using pii = pair<int,int>;
mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

const int MAX = 5e5+1;

#pragma GCC optimize ("Ofast")

ifstream cin("algsort.in");
ofstream cout("algsort.out");

int n , v[MAX];

void quicksort( int st , int dr )
{
    if(st==dr) return;
    int poz = mt()%(dr-st+1)+1;
    swap(v[dr],v[st-1+poz]);
    int ind = st;

    for(int i = st ; i < dr ;i++)
    {
        if(v[i]<v[dr])
        {
            swap(v[i],v[ind]);
            ind++;
        }
    }

    swap(v[ind],v[dr]);

    if(st<ind-1)quicksort(st,ind-1);
    if(dr>ind+1)quicksort(ind+1,dr);
}

signed main(){

    cin >> n;

    for(int i = 1; i <= n ; i++)
    {
        cin >> v[i];
    }

    quicksort(1,n);

    for(int i = 1 ; i <= n ; i++)
    {
        cout << v[i] << ' ';
    }

    return 0;
}