eolymp
bolt
Try our new interface for solving problems
Problems

Period of a string

Period of a string

Time limit 1 second
Memory limit 64 MiB

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.

Input data

One string s (1 ≤ |s| ≤ 5·10^6) that contains the latin letters only.

Output data

The length of a string t.

Examples

Input example #1
abcabcabc
Output example #1
3