1 #include <cstdio>

 2 #include <iostream>

 3 #include <cstring>

 4 #include <set>

 5 using namespace std;

 6 const int maxn = 4e5 + 14;

 7 char s[maxn];

 8 int Next[maxn], Len;

 9 int ans[maxn], cnt;

10

11 void get_next()

12 {

13     Next[0] = -1;

14     int i = 0, j = -1;

15     while(i <= Len)

16     {

17         if(j == -1 || s[i] == s[j])

18         {

19             i++;

20             j++;

21             Next[i] = j;

22         }

23         else

24         {

25             j = Next[j];

26         }

27     }

28 }

29

30 void solve()

31 {

32     get_next();

33     cnt = 0;

34     while(Len > 0)

35     {

36         ans[cnt++] = Len;

37         Len = Next[Len];

38     }

39     cnt--;

40     while(cnt > 0)

41     {

42         printf("%d ", ans[cnt--]);

43     }

44     printf("%d\n", ans[0]);

45 }

46

47 int main()

48 {

49     //freopen("input.txt", "r", stdin);

50     while(scanf("%s", s) != EOF)

51     {

52         Len = strlen(s);

53         solve();

54     }

55     return 0;

56 }