#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector <int> s;
vector <int> :: iterator it;
int main()
{
  int i,x,n;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
   scanf("%d ",&n);
   for(i=1;i<=n;++i)
   {
       scanf("%d",&x);
       s.push_back(x);
   }
   sort(s.begin(),s.end());
   for(it=s.begin();it!=s.end();++it)
   {
       printf("%d ",*it);
   }
    return 0;
}