/*******************************************
  Author:BlueEve
  Copyright:reserved
  Time:
  Lang:C
  Notes:Quick Sort template
 ******************************************/

#include<cmath>
#include<iostream>

//other used functions:
void quicksort(int a[],int l,int r);

using namespace std;
int main(){
	int a[1000000000],n=0;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	quicksort(a,1,n);
	printf("\n\n");
	for(int i=1;i<=n;i++){
		printf("%d ",a[i]);
	}
	return 0;
}

void quicksort(int a[],int l,int r){
	int i=l,j=r,flag=(l+r)/2,tmp;
	do{
		while(a[i]<flag) i++;
		while(a[j]>flag) j--;
		if (i<=j){
			tmp=a[i];a[i]=a[j];a[j]=tmp;
			i++;
			j--;
		}
	}
	while(i<=j);
	if(l<j)
		quicksort(a,l,j);
	if(i<r)
		quicksort(a,i,r);
	
}
  
  
  
  

反手就是5个TLE T^T