#include<iostream>
#include<fstream>
using namespace std;
 void quickSort(int arr[10001], int left, int right)
 {
  int i = left, j = right;
  int tmp;
  int pivot = arr[(left + right) / 2];

  
  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--;
    }
}

if (left < j)
    quickSort(arr, left, j);
if (i < right)
        quickSort(arr, i, right);
}

int main()
{ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,v[10001];
f>>n;
for(i=1;i<=n;i++)
	f>>v[i];
quickSort(v,1,n);
for(i=1;i<=n;i++)
	g<<v[i]<<" ";
g<<"\n";
f.close();
g.close();
return 0;
}