This is a way to arounding up to nearest integer. For example 3/2 mast be 2, not 1.

You are not decreasing r by 5 but 4 that's the part I am having diffuculty to understand.

Can someone please explain in detail with an example, I couldn't understand the solution showed in the comments.

Found my problem, for some reason I mentally removed the parentheses (pls don't ask why), so my calculations are off by 1 (each iteration). I did n - names.length - 1, instead it was n - (names.length - 1) or n - names.length + 1 if you want.

Sorry yeah, you're right. Fixing that the 21st should anyway endup on L(eonard) though:

S L P R H
SS LL PP RR HH
SSSS L(L)LL PPPP RRRE HHHH

So it doesn't change the fact that the index would go to -1.

Your third line is wrong, it should be SSSS and so on

I knew, that there will be very elegant solution, and as always it exceeded any of my expectations.
Thank you, it is beautiful.

Benefited greatly

Wow! So elegant!

And here I thought my solution was elegant. Noice!

Great solution!

Thank you!

Respect, very beautiful solution! Could you possibly explain how you found the formula or why it works?