#include <vector>
#include <algorithm>
#include <stdio.h>
#define N 500001
int v[N];

using namespace std;
bool compara (int p1,int p2)
{if(p1<p2)
  return true;
 return false;
}

int main ()
{int i,n,x;

 freopen("algsort.in","r",stdin);
 freopen("algsort.out","w",stdout);
 scanf("%d",&n);
 
 for (i=0;i<n;i++)
 {scanf("%d",&v[i]);
 }
 
 sort(v,v+n,compara);
 
 for (i=0;i<n;i++)
 {printf("%d ",v[i]);
 }
 return 0;
}