Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 4000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Difficulty Alpha
A period of a string is a prefix that can be used to generate the whole string by repeating the prefix. The last repetition may be partial. For example, the periods of 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≤n≤106
Example
Input:
abcabca
Output:
3 6 7
Для отправки решений необходимо выполнить вход.
|