/*排序之插入排序*/
#include<iostream>
#include<cstdlib>
using namespace std;

int main()
{
	int n;
	cin>>n;
	int a[n];
	for(int i=1;i<=n;++i)
		cin>>a[i-1];
	for(int i=1;i<=n;++i)
	{
		int now=a[i-1];
		int nowp=i;
		for(int j=i;j<=n;++j)
			if(a[j-1]<now)
			{
				now=a[j-1];
				nowp=j;
			}
		int ifk=0;
		for(int j=1;j<=i;++j)
			if(now<a[j-1])
			{
				for(int ii=nowp-2;ii>=i-1;--ii)
					a[ii+1]=a[ii];
				a[i-1]=now;
				ifk=1;
				break;
			}
		if(ifk==0)
			a[i-1]=now;
	} 
	for(int i=1;i<=n;++i)
		cout<<a[i-1]<<" ";
	system("pause");
	return 0;
}