#include <vector>
#include <cstdio>
#include <algorithm>

using namespace std;

vector<int> V;
int N,x;

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

    scanf("%d",&N);
    for(int i = 1; i <= N; ++i){
        scanf("%d",&x);
        V.push_back(x);
    }
    sort(V.begin(),V.end());
    for(int i = 0; i < N; ++i)
        printf("%d ",V[i]);
    return 0;
}