- Time limit: 1.00 s
- Memory limit: 512 MB
abcabca
are abc
, abcabc
and abcabca
.Your task is to find all period lengths of a string.
Input
The only input line has a string of length $n$ consisting of characters a–z.
Output
Print all period lengths in increasing order.
Constraints
- $1 \le n \le 10^6$
Input:
abcabca
Output:
3 6 7