The string s is given. Find the string t of minimum length such that s can be represented as a concatenation of one or some copies of t.
One string s (1 ≤ |s| ≤ 5·10^6) that contains the latin letters only.
The length of a string t.