#include <iostream>
using namespace std;

int n,A[500010];

void qsort(int x, int y){
  int i=x,j=y,k;
  k=A[(x+y)/2];
  while (i<=j){
    while (A[i]<k) i++;
    while (A[j]>k) j--;
    if (i<=j) swap(A[i],A[j]),i++,j--;
  }
  if (j>x) qsort(x,j);
  if (i<y) qsort(i,y);
}

int main(){
  ifstream cin ("algsort.in");
  ofstream cout ("algsort.out")
  cin>>n;
  for (int i=1; i<=n; i++) cin>>A[i];
  qsort(1,n);
  for (int i=1; i<=n; i++) cout<<A[i]<<" ";
  return 0;
}