/*
    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<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 long long
#define mod 1000000009LL
#define N 130
#define SQR 350
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 666013
#define mod 1000000007
#define DIM 600100
#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 n,v[N],buc[N],st[N],dr[N];
void solve(int st,int dr)
{
    FOR(i,st,dr)
    {
        FOR(j,i,dr)
        if(v[j]<v[i])
            swap(v[j],v[i]);
    }
}
int main ()
{

    f>>n;
    int sqr=(int)sqrt(n);
    FOR(i,1,n)
        f>>v[i];
    FOR(i,1,n)
    {
        buc[i]=(i+sqr-1)/sqr;
        if(!st[buc[i]])
            st[buc[i]]=i;
        dr[buc[i]]=i;
    }
    int nrb=(n+sqr-1)/sqr;
    FOR(i,1,nrb)
    {
        solve(st[i],dr[i]);
    }
    FOR(i,1,n)
    {
        int b=0;
        FOR(j,1,nrb)
        {
            if(st[j]<=dr[j])
                if(!b||v[st[j]]<v[b])
                    b=st[j];
        }
        g<<v[b]<<" ";
        st[buc[b]]++;
    }
    return 0;
}