#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

int n,x;
vector<int>A;

int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
    {
        fin>>x;A.push_back(x);
    }
    sort(A.begin(),A.end());
    for(auto it:A)
        fout<<it<<' ';
    return 0;
}