#include <iostream>
#include <fstream>
using namespace std;
int v[50]; 
int n;
int
main ()
{
    ifstream fin ('algsort.in');
    ofstream fout ('algsort.out');
  fin >> n;
  int k = 1, nr = 0;
  for (int i = 1; i <= n; i++)
    fin >> v[i];
  while (k != 0)
    {
      for (int i = 0; i < n; i++)
	{
	  if (v[i] > v[i + 1])
	    {
	      swap (v[i], v[i + 1]);
	      nr += 1;
	    }
	}
      if (nr == 0)
	k = 0;
      else
	nr = 0;
    }
  for (int i = 1; i <= n; i++)
    fout << v[i];
    fin.close();
    fout.close();
    return 0;
}