// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 3e6 + 5;

char s[N];

int n, z[N];

void inline exKMP() {
	z[1] = n;
	int r = 0, mid = 0;
	for (int i = 2; i <= n; i++) {
		if (i <= r) z[i] = min(r - i + 1, z[i - mid + 1]);
		while (i + z[i] <= n && s[i + z[i]] == s[1 + z[i]]) ++z[i];
		if (i + z[i] - 1 > r) r = i + z[i] - 1, mid = i;
	}
}

// compare pre1 and prex in lens m

int inline cmp(int x, int m) {
	int o = z[x];
	if (o >= m) return 0;
	return s[1 + o] < s[x + o] ? -1 : 1;
}

// x > y, in pre i

int inline chk(int x, int y, int i) {
	if (x == y) return 0;
	int o = cmp(y + i - x + 1, x - y);
	if (o) return o;
	o = cmp(x - y + 1, y - 1);
	if (!o) return 1;
	return o * -1;
}

vector<int> A;

int main() {
    scanf("%s", s + 1); n = strlen(s + 1);
    exKMP();
    for (int i = 1; i <= n; i++) {
    	vector<int> t;
    	t.pb(i);
    	for (int v: A) {
    		while (t.size() && s[i] > s[v + i - t.back()]) t.pop_back();
    		if (!t.size() || s[i] == s[v + i - t.back()]) {
    			while (t.size() && i - v + 1 < 2 * (i - t.back() + 1)) t.pop_back();
    			t.pb(v);
    		}
    	}
    	A = t;
    	int ans = A[0];
    	for (int v: A) {
    		if (chk(ans, v, i) == 1) ans = v;
    	}
    	printf("%d ", ans);
    }

    return 0;
}