#include<fstream>
#define maxn 500010
using namespace std;
int n,left,right;
int arr[maxn];
ifstream f("algsort.in");
ofstream g("algsort.out");

void citire(){
	f>>n;
	for(int i=1;i<=n;i++)
		f>>arr[i];
}

void quickSort(int arr[], int left, int right) {
      int i = left, j = right;
      int tmp;
      int pivot = arr[(left + right) / 2];
      /* partition */
      while (i <= j) {
            while (arr[i] < pivot)
                  i++;
            while (arr[j] > pivot)
                  j--;
            if (i <= j) {
                  tmp = arr[i];
                  arr[i] = arr[j];
                  arr[j] = tmp;
                  i++;
                  j--;
            }
      };
      /* recursion */
      if (left < j)
            quickSort(arr, left, j);
      if (i < right)
            quickSort(arr, i, right);
}

int main(){
	citire();
	quickSort(arr,1,n);
	for(int i=1;i<=n;i++)
		g<<arr[i]<<' ';
	g<<'\n';
	g.close();
	return 0;
}