#include <fstream>
#include<algorithm>

using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");

void qsort(int v[], int st, int dr)
{
      int i=st, j=dr;
      int piv = v[(st+dr)/2];
      while (i <= j)
      {
            while (v[i] < piv) i++;
            while (v[j] > piv) j--;
            if (i <= j)
            {
                  swap(v[i],v[j]);
                  i++;
                  j--;
            }
      }
      if (st < j) qsort(v, st, j);
      if (i < dr) qsort(v, i, dr);
}

int main()
{
    int n, v[500001], i;
    cin>>n;
    for(i=1;i<=n;i++)cin>>v[i];
    qsort(v, 1, n);
    for(i=1;i<=n;i++)cout<<v[i]<<" ";
    return 0;
}