#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

int N;
vector<int> myNumbers;

void read()
{
    ifstream fin("algsort.in");

    fin >> N;
    for(int i = 0; i < N; ++i)
    {
        int x;
        fin >> x;
        myNumbers.push_back(x);
    }

    fin.close();
}

void solve()
{
    sort(myNumbers.begin(), myNumbers.end());
}

void write()
{
    ofstream fout("algsort.out");

    vector<int> :: iterator it;
    for(it = myNumbers.begin(); it != myNumbers.end(); ++it)
        fout << *it << ' ';

    fout.close();
}

int main()
{
    read();
    solve();
    write();

    return 0;
}