#include <fstream>
#include <queue>

using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int i,n,x;
priority_queue <int,vector <int>,greater <int> > Q;
int main()
{
  in>>n;
  for (i=1;i<=n;++i)
  {
      in>>x;
      Q.push(x);
  }
  for (i=1;i<=n;++i)
  {
      out<<Q.top()<<" ";
      Q.pop();
  }
    return 0;
}