#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstdlib>
#include <ctime>

using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");

#define ll long long
#define pb push_back
const int NMax = 5e5 + 5;
const int inf = 1e9 + 5;

int N;
// int v1[NMax];
int v2[NMax];

void quickSort(int*,int,int);
int part(int*,int,int);

int main() {
    in>>N;
    for (int i=1;i <= N;++i) {
        int val;
        in>>val;

        //v1[i] = val;
        v2[i] = val;
    }

    srand(time(0));
    quickSort(v2,1,N);

    /*
    sort(v1+1,v1+N+1);

    int coll = false;
    for (int i=1;i <= N;++i) {
        if (v1[i] != v2[i]) {
            coll = true;
        }
    }

    if (coll) {
        cout<<coll<<'\n';
    }

    for (int i=1;i <= N;++i) {
       out<<v1[i]<<' ';
    }
    out<<'\n';
    //*/

    for (int i=1;i <= N;++i) {
       out<<v2[i]<<' ';
    }
    out<<'\n';

    in.close();out.close();
    return 0;
}

void quickSort(int* v,int st,int dr) {
    if (st >= dr) {
        return;
    }

    //cout<<"Part\n";
    int idx = part(v,st,dr);
    quickSort(v,st,idx-1);
    quickSort(v,idx+1,dr);
}

int part(int* v,int st,int dr) {

    int i = st-1,j = dr+1;
    while (true) {
        do {
            ++i;
        }
        while (v[i] < v[st]);

        do {
            --j;
        }
        while (v[j] > v[st]);

        if (i < j) {
            swap(v[i],v[j]);
        }
        else {
            swap(v[st],v[j]);
            return j;
        }
    }
}