P1259 Movement of Black and White Pieces

# Description There are $2n$ pieces arranged in a row. Initially, all white pieces are on the left and all black pieces are on the right. The following figure shows the case $n=5$.  The rules for moving the pieces are as follows: in each move, you must move two adjacent pieces simultaneously, regardless of their colors. They may move left or right into empty positions, but their left–right order cannot be swapped. Each move must jump over one or more pieces (you cannot simply slide). The goal is to obtain a row of pieces alternating in color. For example, when $n=5$, the target becomes:  Task: write a program to print the whole sequence of moves.

There are $2n$ pieces arranged in a row. Initially, all white pieces are on the left and all black pieces are on the right. The following figure shows the case $n=5$.  The rules for moving the pieces are as follows: in each move, you must move two adjacent pieces simultaneously, regardless of their colors. They may move left or right into empty positions, but their left–right order cannot be swapped. Each move must jump over one or more pieces (you cannot simply slide). The goal is to obtain a row of pieces alternating in color. For example, when $n=5$, the target becomes:  Task: write a program to print the whole sequence of moves. # Description

A single integer $n$.

Multiple lines, showing the initial state and the state after each move. Use 'o' to denote a white piece, '*' to denote a black piece, and '-' to denote an empty cell.

Constraints: $4 \leq n \leq 100$. Translated by ChatGPT 5