/*
#include <stdio.h>
int n;
void Swap(int arr[], int id1, int id2)
{
int temp = arr[id1];
arr[id1] = arr[id2];
arr[id2] = temp;
}
int partition(int arr[], int left, int right)
{
int pivot = arr[left];
int low = left+1;
int high = right;
while(low <= high)
{
while(pivot >= arr[low] && low <= right)
low++;
while(pivot <= arr[high] && high >= (left+1))
high--;
if(low <= high)
Swap(arr, low, high);
}
Swap(arr, left, high);
return high;
}
void QuickSort(int arr[], int left, int right)
{
if(left <= right)
{
int pivot = partition(arr, left, right);
QuickSort(arr, left, pivot-1);
QuickSort(arr, pivot+1, right);
}
}
int main(void)
{
int i, arr[100001];
scanf("%d",&n);
for(i=0; i<n; i++)
{
scanf("%d",&arr[i]);
}
QuickSort(arr, 0, n-1);
for(i=0; i<n; i++)
{
printf("%d\n",arr[i]);
}
return 0;
}
*/