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

void swap(int& a, int& b)
{
	int aux=a;
	a=b;
	b=aux;
}

int partition(vector<int>& v, int left, int right)
{
	int pivot=v[left];

	int i=left+1;
	for(int j=left+1;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)
		return;
	int r=partition(v,left,right);

	quick_sort(v,left,r-1);
	quick_sort(v,r+1,right);
}
	
int main()
{
	ifstream in("algsort.in");
	ofstream out("algsort.out");
	int n;
	vector<int> v;
	in>>n;
	int nr;
	
	for(int i=0;i<n;++i)
	{
		in>>nr;
		v.push_back(nr);
	}
	quick_sort(v,0,n-1);

	for(int i=0;i<n;++i)
		out<<v[i]<<" ";
	out<<endl;
}