1326v2

#include <iostream>
//#include <chrono>
//#include <fstream>
//#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>

#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

const ull MOD = 1e9 + 9;
const int P = 31;

int main() {
    /*ifstream cin("in.txt");
    ofstream cout("out.txt");
    auto start_time = chrono::high_resolution_clock::now();*/

    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);


    string str;
    cin >> str;
    int len = str.size();
    vector<int> pref(len);
    vector<int> suff(len);
    vector<int> pw(len);

    pw[0] = 1;
    for (int i = 1; i < len; i++) pw[i] = (pw[i - 1] * (ll)P) % MOD;

    pref[0] = (str[0] - 'a' + 1) * pw[0];
    for (int i = 1; i < len; i++)
        pref[i] = (pref[i - 1] + ((str[i] - 'a' + 1) * (ll)pw[i]) % MOD) % MOD;

    suff[len-1] = (str[len-1] - 'a' + 1) * pw[0];
    for (int i = len - 2; i >= 0; i--)
        suff[i] = (suff[i + 1] + ((str[i] - 'a' + 1) * (ll)pw[len - i - 1]) % MOD) % MOD;

    vector<int> answ(len);
    answ[0] = 0;
    answ[len-1] = 0;
    for (int i = 1; i < len - 1; i++) {
        int l = 0, r = min(i - 0, len - i - 1) + 1;
        while (l + 1 < r) {
            int mid = (l + r) / 2;
            ll a = (MOD + (ll)pref[i + mid] - (ll)pref[i - 1]) % MOD;
            ll b = (MOD + (ll)suff[i - mid] - (ll)suff[i + 1]) % MOD;
            if (i < len - i) {
                if (a * pw[abs(2 * i - len + 1)] % MOD == b)
                    l = mid;
                else
                    r = mid;
            }
            else {
                if (b * pw[abs(2 * i - len + 1)] % MOD == a)
                    l = mid;
                else
                    r = mid;
            }
        }
        answ[i] = l;
    }

    for (int i : answ)
        cout << 1 + i * 2 << " ";

    /*auto end_time = chrono::high_resolution_clock::now();
    chrono::duration<double> duration = end_time - start_time;
    cout << duration.count() << "\n";
    cin.close();
    cout.close();*/
    return 0;
}