/*
#include <stdio.h>
int main()
{
int a[10000],i,j,n,temp;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
}
for(i=1;i<n;i++){
for(j=1;j<n;j++){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
for(i=1;i<=n;i++){
printf("%d ",a[i]);
}
}
*/
/*
#include <stdio.h>
int main()
{
int i,t,n;
int a[24]={};
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&t);
a[t]++;
}
for(i=1;i<=23;i++){
printf("%d ",a[i]);
}
}
*/
/*
#include <stdio.h>
int main()
{
int i,j,t,n,cnt;
int a[100001]={};
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&t);
a[t]=a[t]+1;
}
for(i=0;i<=100000;i++){
for(j = 1 ; j <= a[i] ; j++)
{
printf("%d ",i);
}
}
return 0;
}
*/
/*
#include <stdio.h>
void swap(int a[],int id1,int id2)
{
int temp=a[id1];
a[id1]=a[id2];
a[id2]=temp;
}
int partition(int a[],int left,int right)
{
int pivot=a[left];
int low=left+1;
int high=right;
while(low<=high){
while(pivot>=a[low]&&low<=right){
low++;
}
while(pivot<=a[high]&&high>=left+1){
high--;
}
if(low<=high){
swap(a,low,high);
}
}
swap(a,left,high);
return high;
}
void quicksort(int a[],int left,int right)
{
if(left<=right){
int pivot=partition(a,left,right);
quicksort(a,left,pivot-1);
quicksort(a,pivot+1,right);
}
}
int main(void)
{
int a[100000],i,n;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
quicksort(a,0,n-1);
for(i=0;i<n;i++){
printf("%d\n",a[i]);
}
}
*/