#include <fstream>
#include <algorithm>
#include <deque>

using namespace std;

ifstream cin ("algsort.in" );
ofstream cout("algsort.out");

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

    deque <int> a(n);
    for (int i = 0, x; i < a.size(); i++)
        cin >> a[i];

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

    for (int i = 0; i < a.size(); i++)
        cout << a[i] << ' ';

    return 0;
}