# Power Strings

Easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Given two strings $a$ and $b$ we define $a∗b$ to be their concatenation.

For example, if $a="abc"$ and $b="def"$ then $a∗b="abcdef"$.

If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way:

$a_{0}$ = “” (empty line)

$a_{n+1}=a∗a_{n}$

For a given string $s$ print the largest $n$ such that $s=a_{n}$ for some string $a$.

## Input

Each test case is a line representing $s$, a string of printable characters. The length of $s$ will be at least $1$ and will not exceed $10_{6}$ characters.

## Output

For each input string $s$ print in a separate line the largest $n$ such that $s=a_{n}$ for some string $a$.

## Examples

Input #1

Answer #1

Submissions 2K

Acceptance rate 24%