How does the Duval algorithm handle odd-length strings?

Finding the lexically minimal rotation of strings is a well known problem for which a linear time algorithm was proposed by Jean Pierre Duval in 1983. This blog post is probably the only publicly available resource that talks about the algorithm in detail. However, Duval's algorithms are based on the idea of ​​paired comparisons ("duels"), and the blog conveniently uses a string of the same length as an example.

How does the algorithm work for odd-length strings, where the last character would not have a duel competitor?