#include <fstream>
using namespace std;
int N, *v;
void swap(int *a, int *b)
{
  int t=*a; *a=*b; *b=t;
}
void quickSort(int arr[], int beg, int end)
{
  if (end > beg + 1)
  {
    int piv = arr[beg], l = beg + 1, r = end;
    while (l < r)
    {
      if (arr[l] <= piv)
        l++;
      else
        swap(&arr[l], &arr[--r]);
    }
    swap(&arr[--l], &arr[beg]);
    quickSort(arr, beg, l);
    quickSort(arr, r, end);
  }
}
  int main()
  {
	  ifstream in("algsort.in");
	  in>>N;
	  v=new int[N];
	  for( int i=0; i < N; ++i ) in>>v[i];
	  quickSort( v, 0, N );
	  ofstream out("algsort.out");
	  for( int i=0; i < N; ++i ) out<<v[i]<<' ';
	  delete[] v;
	  return 0;
	 }