#include <algorithm>
#include <vector>
#include <cstdio>

using namespace std;

vector<int> v;

int main()
{
    int i, x, n;

    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);

     scanf("%d",&n);

     for(i = 0; i < n; i++ )
     {
         scanf("%d",&x);
         v.push_back(x);
     }

     sort(v.begin(),v.end());

     for(i = 0; i < n; i++)
        printf("%d ",v[i]);
    return 0;
}