/*#include <fstream>
#include <climits>

using namespace std;

ifstream fin ("ssm.in");
ofstream fout ("ssm.out");

const int NMAX = 6 * (1e6);
int v[NMAX + 5];

int main()
{
    int n;
    fin >> n;

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

    int st = 0, start = 0, finish = 0;
    long long s = 0, maxim = INT_MIN;

    for(int i = 1; i <= n; i++)
    {
        if(s + v[i] < v[i])
        {
            st = i;
            s = v[i];
        }
        else
            s += v[i];

        if(maxim < s)
        {
            start = st;
            finish = i;
            maxim = s;
        }
        else if(maxim == s)
        {
            if(i - st < finish - start)
            {
                start = st;
                finish = i;
            }
        }
    }

    fout << maxim << ' ' << start << ' ' << finish;

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

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin ("algsort.in");
ofstream fout ("algsort.out");

const int NMAX = 5 * (1e5);
int v[NMAX + 5];

int main()
{
    int n;
    fin >> n;

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

    sort(v + 1, v + n + 1);

    for(int i = 1; i <= n; i++)
    fout << v[i] << ' ';

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