#include <fstream>
#include <algorithm>
#include <queue>

using namespace std;

int* ReadVector(int n, istream &fin);

int main()
{
    ifstream fin;
    ofstream fout;
    fout.open("algsort.out");
    fin.open("algsort.in");

    int n;
    fin >> n;

    int* list = ReadVector(n, fin);
    std::sort(list + 1, list + n + 1);

    for(int i = 1; i <= n; i ++)
    {
        fout << list[i] << " ";
    }

    fin.close();
    fout.close();
    return 0;
}

int* ReadVector(int n, istream &fin)
{
    int *list = new int[n + 1]();

    for(int i = 1; i <= n; i++)
    	fin >> list[i];

    return list;
}