/*
    Look at me!
    Look at me!
    Look at how large the monster inside me has become!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<unsigned int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod  4398042316799LL
#define DIM 60010000
#define base 256
#define bas 255
#define N 100100
using namespace std;
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[N];
int n;
void go(int st,int dr)
{
    if(st>=dr)
        return ;
    int mij=(st+dr)>>1;
    nth_element(v+st,v+mij,v+dr+1);
    int l=st;
    int r=dr;
    while(l<=r)
    {
        while(v[l]<=v[mij]&&l<mij)
            ++l;
        while(v[r]>=v[mij]&&r>mij)
            --r;
        if(l==mij||r==mij)
            break;
        swap(v[l],v[r]);
        ++l;
        --r;
    }
    go(st,mij-1);
    go(mij+1,dr);
}
int main ()
{
    f>>n;
    FOR(i,1,n)
    f>>v[i];
    go(1,n);
    FOR(i,1,n)
    g<<v[i]<<" ";
    return 0;
}