Minimum Moves

Given a string $S$, we need to write a program to check if it is possible to construct the given string $S$ by performing any of the below operations any number of times. In each step, we can: - Add any character at the end of the string. - append the string to the string itself. The above steps can be applied any number of times. We need to print the minimum steps required to form the string. #