#include <fstream.h>

using namespace std;
ifstream f ("algsort.in");
ofstream g ("algsort.out");

int main()
{
   int a[500001], i , n, k, c;
   f >> n;
   for (i=1; i<=n;i++)
   {
       f>> a[i];
   }
   for (i=1; i<=n; i++)
   {
       k=i+1;
       while (k<=n)
       {
           if (a[k]<a[i])
           {
               c=a[i];
               a[i]=a[k];
               a[k]=c;
           }
           k++;
       }
   }
   for (i=1; i<=n; i++)
   g << a[i] << " ";
    return 0;
}