#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
vector <int> a;
int n,i,x;
void Sort(int i,int j)
{
	if(a[i]>a[j])
		swap(a[i],a[j]);
	if(i+1>=j)
		return ;
	int k=(j-i+1)/3;
	Sort(i,j-k);
	Sort(i+k,j);
	Sort(i,j-k);
}
inline void Cout(int x)
{
	printf("%d ",x);
}
int main()
{
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&x);
		a.push_back(x);
	}
	Sort(0,n-1);
	for_each(a.begin(),a.end(),Cout);
	printf("\n");
	return 0;
}