Given two strings a and b we define to be their concatenation. For example, if and b = “def” then . If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: “” (the empty string) and .
Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.
For each s you should print the largest n such that for some string .
This problem has huge input, use scanf instead of cin to avoid time limit exceed.