#include <bits/stdc++.h>
using namespace std;
bool my_less(string s1, string s2) {
  int n = s1.size();
  int m = s2.size();
  for (int i = 0; i < min(n, m); i++) {
    if (s1[i] != s2[i]) {
      return s1[i] < s2[i];
    }
  }
  return n <= m;
}
bool my_lessr(string s1, string s2) {
  int n = s1.size();
  int m = s2.size();
  for (int i = n - 1, j = m - 1; i >= 0 && j >= 0; i--, j--) {
    if (s1[i] != s2[j]) {
      return s1[i] < s2[i];
    }
  }
  return n <= m;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  int n = s.size();
  vector<vector<string> > dp(n, vector<string>(2));
  vector<vector<int> > prev(n, vector<int>(2));
  vector<vector<int> > ans(n, vector<int>(2));
  dp[0][0] = s[0];
  dp[0][1] = s[0];
  for (int i = 1; i < n; i++) {
    string s1 = dp[i - 1][0] + s[i];
    string s2 = dp[i - 1][1] + s[i];
    if (my_less(s1, s2)) {
      dp[i][0] = s1;
      prev[i][0] = 0;
      ans[i][0] = 0;
    } else {
      dp[i][0] = s2;
      prev[i][0] = 1;
      ans[i][0] = 0;
    }
    if (my_lessr(s1, s2)) {
      dp[i][1] = s1;
      prev[i][1] = 0;
      ans[i][1] = 0;
    } else {
      dp[i][1] = s2;
      prev[i][1] = 1;
      ans[i][1] = 0;
    }
    reverse(s1.begin(), s1.end());
    reverse(s2.begin(), s2.end());
    if (my_less(s1, s2) && my_less(s1, dp[i][0])) {
      dp[i][0] = s1;
      prev[i][0] = 0;
      ans[i][0] = 1;
    } else if (my_less(s2, s1) && my_less(s2, dp[i][0])) {
      dp[i][0] = s2;
      prev[i][0] = 1;
      ans[i][0] = 1;
    }
    if (my_lessr(s1, s2) && my_lessr(s1, dp[i][1])) {
      dp[i][1] = s1;
      prev[i][1] = 0;
      ans[i][1] = 1;
    } else if (my_lessr(s2, s1) && my_lessr(s2, dp[i][1])) {
      dp[i][1] = s2;
      prev[i][1] = 1;
      ans[i][1] = 1;
    }
  }
  int ind = n - 1;
  int k = 0;
  vector<int> res;
  while (ind >= 0) {
    res.push_back(ans[ind][k]);
    k = prev[ind][k];
    ind--;
  }
  for (int i = res.size() - 1; i >= 0; i--) {
    cout << res[i] << " ";
  }
}
