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

using namespace std;

int main()
{
    FILE * iFile;
    FILE * oFile;

    iFile = fopen("algsort.in", "r");
    oFile = fopen("algsort.out", "w");

    int n, i, x;
    vector<int> bvector;
    vector<int>::iterator it;

    fscanf(iFile, "%d", &n);

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

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

    for(it=bvector.begin();it!=bvector.end();it++)
    {
        fprintf(oFile, "%d ", *it);
    }

    fclose(iFile);
    fclose(oFile);

    return 0;
}