#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
vector <int> a;
int n;
bool compara(int x,int y)
{
    return x<y;
}
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    int x;
    for(int i=0;i<n;i++)
    {
        scanf("%d",&x);
        a.push_back(x);
    }
    sort(a.begin(),a.end(),compara);
    for(int i=0;i<n;i++)
        printf("%d ",a[i]);
}