#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;

int i,n,x;
vector <int>::iterator it;

int main()
{
   freopen("algsort.in","r",stdin);
   freopen("algsort.out","w",stdout);
   scanf("%ld",&n);
   vector <int> a(2);
   for (i=1;i<=n;++i)
   {
      scanf("%ld",&a[i]);
      a.reserve(1);
   }
   sort(a.begin()+1,a.begin()+n+1);
   //for (it=a.begin();it<a.end();++it)
   for (i=1;i<=n;++i)
      printf("%ld ",a[i]);
   return 0;
}