#include <fstream>
using namespace std;
ifstream in ("algsort.in");
ofstream out ("algsort.out");
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--;
            }
      }
      if (left < j)
            quickSort(arr, left, j);
      if (i < right)
            quickSort(arr, i, right);
}
int main()
{int n,a,b,v[100001],i;
in>>n;
for (i=1;i<=n;i++)
    in>>v[i];
    quickSort(v,1,n);
    for (i=1;i<=n;i++)
        out<<v[i]<<" ";

return 0;}