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

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

int n,x,i;
vector<int> v;


int main()
{
    fin>>n;
    while(n)
    {
        fin>>x;
        v.push_back(x);
        n--;
    }
    sort(v.begin(),v.end());
    for(i=0;i<(int)v.size();++i)
        fout<<v[i]<<" ";


    return 0;
}