#include<fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int a[500001],n;
void stooge(int p,int q)
{if(a[p]>a[q]) {int aux=a[p];a[p]=a[q];a[q]=aux;}
 if(p+1>=q) return;
 int k=(q-p+1)/3;
 stooge(p,q-k);
 stooge(p+k,q);
 stooge(p,q-k);
     
     }
int main()
{in>>n;
for(int i=1;i<=n;i++) in>>a[i];
stooge(1,n);
for(int i=1;i<=n;i++) out<<a[i]<<" ";
    
    
    return 0;}