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

using namespace std;
vector<int> v;
int N,x;

int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&N);
    for(int i = 1; i <= N; ++i)
    {
        scanf("%d",&x);
        v.push_back(x);
    }
    sort(v.begin(),v.end());
    for(int i = 0; i< N; ++i)
        printf("%d ",v[i]);
    return 0;
}