#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

vector <int> v;
int n, i, nr;

bool compare (int a, int b)
{
    return (a < b);
}

int main ()
{
    FILE *f = fopen ("algsort.in","r");
    FILE *g = fopen ("algsort.out","w");
    fscanf (f,"%d", &n);

    for (i=1; i<=n; ++i)
    {
        fscanf (f,"%d", &nr);
        v.push_back (nr);
    }

    /*partial_sort (v.begin(), v.begin() + (n / 2), v.end());
    partial_sort (v.begin() + (n / 2), v.end(), v.end()); */

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

    for (i=0; i < v.size(); ++i)
        fprintf (g,"%d ", v[i]);

    fclose(f);
    fclose(g);
    return 0;
}