#include <stdio.h>
#include <stdlib.h>
int* arr;
int n;
void quicksort(int left, int right);
int main()
{
int i;
scanf("%d", &n);
arr = (int*)malloc(sizeof(int)*n);
for (i = 0; i < n; i++)
scanf("%d", &arr[i]);
quicksort(0, n-1);
for (i = 0; i < n; i++)
printf("%d ", arr[i]);
return 0;
}
void quicksort(int left, int right)
{
int temp, i, j, t;
if (left > right)
return;
temp = arr[left];
i = left;
j = right;
while (i != j)
{
while (i < j&&arr[j] >= temp)
j--;
while (i < j&&arr[i] <= temp)
i++;
if (i < j)
{
t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
}
arr[left] = arr[i];
arr[i] = temp;
quicksort(left, i - 1);
quicksort(i + 1, right);
return;
}