Period of a string#2463
Given a string , find the shortest string such that can be represented as a concatenation of one or more copies of .
The only input is the string (1 \leq |s| \leq 5 \cdot 10^6), consisting of Latin letters only.
Print the length of the string .
Example 1