#include<iostream>
#include<fstream>
using namespace std;
int v[300000000],n,k;
void quicksort(int a[], int left, int right)
{
      int i = left, j = right,man;
      int pivot = a[(left + right) / 2];
      while (i <= j)
      {
            while (a[i] < pivot)
                  i++;
            while (a[j] > pivot)
                  j--;
            if (i <= j)
            {
                man = a[i];
                a[i] = a[j];
                a[j] = man;
                i++;
                j--;
            }
      }
      if (left < j)
            quicksort(a, left, j);
      if (i < right)
            quicksort(a, i, right);
}

int main()
{
  ifstream f("algsort.in");
  ofstream g("algsort.out");
  f>>n;
  for(int i=0;i<n;i++)
    f>>v[i];
  quicksort(v,0,n-1);
  for(int i=0;i<n;i++)
    g<<v[i];
  f.close();
  g.close();
  return 0;
}