Problem: IA has so many colorful magnets on her fridge! Exactly one letter is written on each magnet, 'a' or 'b'. She loves to play with them, placing all magnets in a row. However, the girl is quickly bored and usually thinks how to make her entertainment more interesting.

Today, when IA looked at the fridge, she noticed that the word formed by magnets is really messy. "It would look much better when I'll swap some of them!" — thought the girl — "but how to do it?". After a while, she got an idea. IA will look at all prefixes with lengths from 1 to the length of the word and for each prefix she will either reverse this prefix or leave it as it is. She will consider the prefixes in the fixed order: from the shortest to the largest. She wants to get the lexicographically smallest possible word after she considers all prefixes. Can you help her, telling which prefixes should be chosen for reversing?

A string a is lexicographically smaller than a string b if and only if one of the following holds:

  * a is a prefix of b, but a ≠ b;
  * in the first position where a and b differ, the string a has a letter that appears earlier in the alphabet than the corresponding letter in b.

Input

The first and the only line contains a string s (1 ≤ |s| ≤ 1000), describing the initial string formed by magnets. The string s consists only of characters 'a' and 'b'.

Output

Output exactly |s| integers. If IA should reverse the i-th prefix (that is, the substring from 1 to i), the i-th integer should be equal to 1, and it should be equal to 0 otherwise.

If there are multiple possible sequences leading to the optimal answer, print any of them.

Examples

Input

bbab


Output

0 1 1 0


Input

aaaaa


Output

1 0 0 0 1

Note

In the first example, IA can reverse the second and the third prefix and get a string "abbb". She cannot get better result, since it is also lexicographically smallest string obtainable by permuting characters of the initial string.

In the second example, she can reverse any subset of prefixes — all letters are 'a'.

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Hieu Le
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            char[] s = in.next().toCharArray();
            int n = s.length;

            TaskC.Prefix[] prefixes = new TaskC.Prefix[n];
            for (int i = 0; i < n; ++i)
                prefixes[i] = new TaskC.Prefix();

            // Base case
            prefixes[0].min = prefixes[0].max = "" + s[0];
            prefixes[0].minStep = prefixes[0].maxStep = 0;

            for (int i = 1; i < n; ++i) {
                processMin(prefixes, s, i);
                processMax(prefixes, s, i);
            }

            int[] res = new int[n];
            boolean getMin = true;
            for (int i = n - 1; i >= 0; --i) {
                if (getMin) {
                    res[i] = prefixes[i].minStep;
                    getMin = (res[i] == 0);
                } else {
                    res[i] = prefixes[i].maxStep;
                    getMin = (res[i] == 1);
                }
            }

            for (int r : res)
                out.print(r + " ");
        }

        private void processMax(TaskC.Prefix[] prefixes, char[] s, int index) {
            // No reversal
            String noMax = prefixes[index - 1].max + s[index];
            // Reversal
            String yesMax = s[index] + reverse(prefixes[index - 1].min);

            if (noMax.compareTo(yesMax) > 0) {
                prefixes[index].max = noMax;
                prefixes[index].maxStep = 0;
            } else {
                prefixes[index].max = yesMax;
                prefixes[index].maxStep = 1;
            }
        }

        private void processMin(TaskC.Prefix[] prefixes, char[] s, int index) {
            // No reversal needed
            String noMin = prefixes[index - 1].min + s[index];
            // Reversal needed
            String yesMin = s[index] + reverse(prefixes[index - 1].max);

            if (noMin.compareTo(yesMin) < 0) {
                prefixes[index].min = noMin;
                prefixes[index].minStep = 0;
            } else {
                prefixes[index].min = yesMin;
                prefixes[index].minStep = 1;
            }
        }

        private String reverse(String s) {
            return new StringBuilder(s).reverse().toString();
        }

        static class Prefix {
            String min;
            int minStep;
            String max;
            int maxStep;

        }

    }

    static class InputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;
        private static final int BUFFER_SIZE = 32768;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(
                    new InputStreamReader(stream), BUFFER_SIZE);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

    }
}