#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cassert>
#include<cmath>
#include<utility>
#define eb emplace_back

using namespace std;
const int maxn=1e5+10, inf=1e9+10;
const double eps=1e-10;
typedef long long LL;
typedef pair<int, int> pii;
typedef unsigned long long ULL;

inline int read() {
    int x=0, f=1; char c=getchar();
    for(; c<'0'||c>'9'; c=getchar()) if(c=='-') f=0;
    for(; c>='0'&&c<='9'; c=getchar()) x=x*10+c-'0';
    return f?x:-x;
}
char s[maxn];
int p[maxn];

int main() {
    scanf("%s", s+1);
    int n=strlen(s+1);
    int j=0;
    for(int i=2; i<=n; ++i) {
        while(j&&s[j+1]!=s[i]) j=p[j];
        if(s[j+1]==s[i]) ++j;
        p[i]=j;
    }
    for(int i=1; i<=n; ++i) printf("%d ", p[i]);
    return 0;
}