#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>

typedef long long LL;

#define L int(1e5 + 5)

using namespace std;

char s[L];
int ans[L];

int main() {
    freopen("jumps.in", "r", stdin);
    freopen("jumps.out", "w", stdout);

    gets(s);
    int len = strlen(s);
    s[len] = '!';

    for (int i = 0; i < len; i++) {
        if (s[i] == s[0])
            ans[0]++;
        else
            break;
    }

    for (int i = 1; i < len; i++) {
        if (ans[i - 1] > 1)
            ans[i] = ans[i - 1] - 1;
        else {
            for (int j = i; j < len; j++)
                if (s[j] == s[i])
                    ans[i]++;
                else
                    break;
        }
    }

    for (int i = 0; i < len; i++)
        printf("%d ", ans[i] + 1);

    return 0;
}