#include <bits/stdc++.h>
#define _PRINT_ 1
#define _TEST_ 1
#define _SOLVE_ 1
#if defined(DEBUG) && _PRINT_ == 1
#include "debug.h"
#else
#define print(x, ...) 0
#define debug(x, ...) 0
#define verify(x, ...) 0
#endif
using namespace std;
using ll = long long;
constexpr int inf = 1e9;
constexpr ll llinf = 1e18;
/**
*
*/
void solve() {
string s;
cin >> s;
int n = s.size();
vector<int> ans(n);
for (int i = 0; i < n; i++) {
if (s[i] == 'a') {
if (i == n - 1 || s[i + 1] == 'b') {
ans[i] = 1;
}
} else {
if (i < n - 1 && s[i + 1] == 'a') {
ans[i] = 1;
}
}
}
for (auto x : ans) {
cout << x << " ";
}
}
int main() {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin >> t;
while(t--) {
solve();
}
return 0;
}
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |