#include <iostream>
#include <algorithm>
#include <cstdlib>
using namespace std;

#define type int //change for other types
void quick_sort(type array[],int start,int end) //quick-sorts from start to end inclusive
{
  if(end-start<=0)
    return;
  int rnd=(rand()%(end-start+1))+start;
  swap(array[rnd],array[start]);
  int C_place=start;
  for(int i=C_place+1;i<=end;++i)
      if(array[i]<=array[C_place])
	{
	  swap(array[i],array[C_place+1]);
	  swap(array[C_place],array[C_place+1]);
	  C_place++;
	}
  quick_sort(array,start,C_place-1);
  quick_sort(array,C_place+1,end);
}
#undef type

int main()
{
  srand(1234);
  int n;
  cin>>n;
  int array[n];
  for(int i=0;i<n;++i)
    cin>>array[i];
  quick_sort(array,0,n-1);
  for(int i=0;i<n;++i)
    cout<<array[i]<<" ";
  cout<<endl;
  return -0;
}