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

const int MAX = 5e5+1;

class InParser {
    vector<char> str;
    int ptr;
    ifstream fin;

    char getChar() {
        if (ptr == (int)(str.size())) {
            fin.read(str.data(), str.size());
            ptr = 0;
        }
        return str[ptr++];
    }

    template<class T>
    T getInt() {
        char chr = getChar();
        while (!isdigit(chr) && chr != '-')
            chr = getChar();
        int sgn = +1;
        if (chr == '-') {
            sgn = -1;
            chr = getChar();
        }
        T num = 0;
        while (isdigit(chr)) {
            num = num * 10 + chr - '0';
            chr = getChar();
        }
        return sgn * num;
    }

public:
    InParser(const char* name) : str(1e5), ptr(str.size()), fin(name) { }
    ~InParser() { fin.close(); }

    template<class T>
    friend InParser& operator>>(InParser& in, T& num) {
        num = in.getInt<T>();
        return in;
    }
};

class OutParser {
    vector<char> str;
    int ptr;
    ofstream fout;

    void putChar(char chr) {
        if (ptr == int(str.size())) {
            fout.write(str.data(), str.size());
            ptr = 0;
        }
        str[ptr++] = chr;
    }

    template<class T>
    void putInt(T num) {
        if (num < 0) {
            putChar('-');
            num *= -1;
        }
        if (num > 9)
            putInt(num / 10);
        putChar(num % 10 + '0');
    }

public:
    OutParser(const char* name) : str(1e5), ptr(0), fout(name) { }
    ~OutParser() { fout.write(str.data(), ptr); fout.close(); }

    template<class T>
    friend OutParser& operator<<(OutParser& out, const T num) {
        out.putInt(num);
        return out;
    }

    friend OutParser& operator<<(OutParser& out, const char chr) {
        out.putChar(chr);
        return out;
    }

    friend OutParser& operator<<(OutParser& out, const char* str) {
        for (int i = 0; str[i]; i++)
            out.putChar(str[i]);
        return out;
    }
};

#pragma GCC optimize ("Ofast")

InParser cin("algsort.in");
OutParser 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;
}