#include<vector>
#include<fstream>
#include<iostream>
#include<cstdlib>
using namespace std;

void swap(int& a, int& b)
{
	if(&a!=&b)
	{
		a^=b;
		b^=a;
		a^=b;
	}
}

int partition(vector<int>& v, int left, int right)
{
	srand(time(NULL));
	int len=right-left+1;
	int index=rand()%len;
	
	swap(v[left],v[left+index]);
	int pivot=v[left];
	int i=left+1,j;

	for(j=left+1;j<=right;++j)
	{
		if(v[j]>=pivot)
			break;
		++i;
	}
	++j;	

	for(;j<=right;++j)
	{
		 if(v[j]<pivot)
		 {
			swap(v[j],v[i]);
			++i;
		}
	}
	swap(v[i-1],v[left]);
	return i-1;
}

void quick_sort(vector<int>& v, int left, int right)
{
	if(left<right)
	{
		int r=partition(v,left,right);
		quick_sort(v,left,r-1);
		quick_sort(v,r+1,right);
	}
}
	
int main()
{
	FILE *f=fopen("algsort.in","r");
	FILE *g=fopen("algsort.out","w");
	int n;
	vector<int> v;
	fscanf(f,"%i",&n);
	int nr;
	
	for(int i=0;i<n;++i)
	{
		fscanf(f,"%i",&nr);
		v.push_back(nr);
	}
	quick_sort(v,0,n-1);

	for(int i=0;i<n;++i)
		fprintf(g,"%i ",v[i]);
	fprintf(g,"%s","\n");
	fclose(f);
	fclose(g);
}