13748번 - Periodic Strings 다국어

문제

Define a $k$-periodic string as follows:

A string $s$ is $k$-periodic if $|s|,ドル the length of the string, is a multiple of $k$ and, if you chop the string up into $|s|/k$ substrings of length $k,ドル then each of those substrings (except the first) is the same as the previous substring, but with its last character moved to the front.

For example, the following string is 3ドル$-periodic:

abccabbcaabc

The above string breaks up into substrings abc, cab, bca, and abc, and each substring (except the first) is a rotation of the previous substring (abc $\rightarrow$ cab, cab $\rightarrow$ bca, bca $\rightarrow$ abc).

Given a string, determine the smallest $k$ for which the string is $k$-periodic.

입력

Input will be a single line containing a string $s,ドル (1ドル \leq |s| \leq 100$), consisting only of lower-case letters.

출력

Print a single line containing an integer denoting the smallest value of $k$ for which the input string is $k$-periodic.

제한

힌트