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

using namespace std;

int n;
vector<int> v;

bool cmp(int A,int B)
{
    return A<B;
}
void read()
{
    scanf("%d ",&n);
    int x;
    for(int i=0;i<n;i++)
        {scanf("%d ",&x);
        v.push_back(x);}
    sort(v.begin(),v.begin()+n,cmp);
    for(int i=0;i<n;i++)
        printf("%d ",v[i]);

}
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    read();

    return 0;
}