Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 4000/4000/4000/5000 ms. Memory limit 65000/65000/65000/65000 Kb.
Difficulty Alpha
A border of a string is a prefix that is also a suffix of the string but not the whole string. For example, the borders of abcababcab are ab and abcab.
Your task is to find all border lengths of a given string.
Input
The only input line has a string of length n consisting of characters a–z.
Output
Print all border lengths of the string in increasing order.
Constraints
1≤n≤106
Example
Input:
abcababcab
Output:
2 5
Для отправки решений необходимо выполнить вход.
|