#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef ONLINE_JUDGE
#define getchar getchar_unlocked
#endif
namespace FastIO
{
    char write_cache[40];
    template <class T>
    inline const T read() noexcept
    {
        T x(0);
        char ch(getchar());
        bool f(0);
        while (ch < '0' || ch > '9')
            f ^= ch == '-', ch = getchar();
        while (ch >= '0' && ch <= '9')
            x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
        return f ? -x : x;
    }
    template <class T>
    inline const void read(T &x) noexcept
    {
        x = 0;
        char ch(getchar());
        bool f(0);
        while (ch < '0' || ch > '9')
            f ^= ch == '-', ch = getchar();
        while (ch >= '0' && ch <= '9')
            x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
        x = f ? -x : x;
    }
    template <class T, class... P>
    inline const void read(T &x, P &...ark) noexcept
    {
        x = 0;
        char ch(getchar());
        bool f(0);
        while (ch < '0' || ch > '9')
            f ^= ch == '-', ch = getchar();
        while (ch >= '0' && ch <= '9')
            x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
        x = f ? -x : x;
        read(ark...);
    }
    template <class T>
    inline const void readu(T &x) noexcept
    {
        x = 0;
        char ch(getchar());
        bool f(0);
        while (ch < '0' || ch > '9')
            ch = getchar();
        while (ch >= '0' && ch <= '9')
            x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
    }
    template <class T>
    inline const T readu() noexcept
    {
        T x(0);
        char ch(getchar());
        bool f(0);
        while (ch < '0' || ch > '9')
            ch = getchar();
        while (ch >= '0' && ch <= '9')
            x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
        return x;
    }
    template <class T, class... P>
    inline const void readu(T &x, P &...ark) noexcept
    {
        x = 0;
        char ch(getchar());
        bool f(0);
        while (ch < '0' || ch > '9')
            ch = getchar();
        while (ch >= '0' && ch <= '9')
            x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
        readu(ark...);
    }
    template <class T>
    inline const void readArr(T *begin, T *end) noexcept
    {
        while (begin < end)
        {
            *begin = 0;
            char ch(getchar());
            bool f(0);
            while (ch < '0' || ch > '9')
                f ^= ch == '-', ch = getchar();
            while (ch >= '0' && ch <= '9')
                *begin = (*begin << 1) + (*begin << 3) + (ch ^ 48), ch = getchar();
            *begin = f ? -*begin : *begin;
        }
    }
    template <class T>
    inline const void readArr(T *begin, int cnt) noexcept
    {
        while (cnt--)
        {
            read(*begin);
            ++begin;
        }
    }
    template <class T>
    inline const void write(T x) noexcept
    {
        if (x < 0)
            putchar('-'), x = -x;
        int cnt = 0;
        while (x)
            write_cache[cnt++] = x % 10 ^ 48, x /= 10;
        if (!cnt)
            putchar('0');
        else
            while (cnt--)
                putchar(write_cache[cnt]);
    }
    template <char end = ' ', class T, class... ARK>
    inline const void write(T &x, ARK &...ark) noexcept
    {
        write(x);
        putchar(end);
        write(ark...);
    }
    template <char end = '\n', class T>
    inline const void println(T &x) noexcept
    {
        write(x);
        putchar(end);
    }
    template <char sep = ' ', char endl = '\n', class T>
    inline const void writeArr(T *begin, T *end) noexcept
    {
        while (begin < end)
            write(*begin), putchar(sep), ++begin;
        putchar(endl);
    }
    template <char sep = ' ', char end = '\n', class T>
    inline const void writeArr(T *arr, int cnt)
    {
        while (cnt--)
        {
            write(*arr);
            putchar(sep);
            ++arr;
        }
        putchar(end);
    }
}

#define maxl 2000005
int dp[maxl], j;
string ss;
int main()
{
    cin >> ss;
    int len = ss.length();
    ss = " " + ss;
    for (int i = 2; i <= len; ++i)
    {
        while (j && ss[i] != ss[j + 1])
            j = dp[j];
        if (ss[j + 1] == ss[i])
            j++;
        dp[i] = j;
    }
    int ans = 0;
    for (int i = 1; i <= len; ++i)
    {
        ans = dp[i];
        while (ans > (((i - 1) >> 1)))
            ans = dp[ans];
        FastIO::println<' '>(ans);
    }
    return 0;
}