Suppose you have a strip of 2 n+1 squares, with n frogs on the n squares on the left, and n toads on the n squares on the right. A move consists either of a toad or a frog sliding to an adjacent square if it is vacant, or of a toad or a frog jumping one square over another one and landing on the next square if it is vacant. For instance, the starting position
has the position
or the position
as results of valid first moves. What is the minimum number of moves needed to swap the toads with the frogs if n=5? How about n=6? Concatenate your answers.