#include <queue>
#include <fstream>
using namespace std;

int main(int argc, char *argv[])
{
  int n;

  priority_queue<int, vector<int>, greater<int> > pq;
  ifstream in("algsort.in");
  in >> n;
  for(int c = 1, x; c <= n; ++c) in >> x, pq.push(x);

  ofstream out("algsort.out");
  while(!pq.empty()) out << pq.top() << ' ', pq.pop();
  out << endl;

  return 0;
}