Problem: When Serezha was three years old, he was given a set of cards with letters for his birthday. They were arranged into words in the way which formed the boy's mother favorite number in binary notation. Serezha started playing with them immediately and shuffled them because he wasn't yet able to read. His father decided to rearrange them. Help him restore the original number, on condition that it was the maximum possible one. 

Input

The first line contains a single integer n (1 ⩽ n ⩽ 10^5) — the length of the string. The second line contains a string consisting of English lowercase letters: 'z', 'e', 'r', 'o' and 'n'.

It is guaranteed that it is possible to rearrange the letters in such a way that they form a sequence of words, each being either "zero" which corresponds to the digit 0 or "one" which corresponds to the digit 1.

Output

Print the maximum possible number in binary notation. Print binary digits separated by a space. The leading zeroes are allowed.

Examples

Input


4
ezor


Output


0 


Input


10
nznooeeoer


Output


1 1 0 

Note

In the first example, the correct initial ordering is "zero".

In the second example, the correct initial ordering is "oneonezero".

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
public class test {
    public static void main(String args[]) throws IOException {
        final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        //final BufferedWriter wr = new BufferedWriter(new OutputStreamWriter(System.out));
        final int n = Integer.parseInt(br.readLine());
        String str = br.readLine();
        solve(n, str);
        //wr.write(String.valueOf(solve(n, str)));
        br.close();
        //wr.close();
    }
    static void solve(int n, String str) {
        HashMap<Character, Integer> map = new HashMap<>();
        map.put('z', 0);
        map.put('e', 0);
        map.put('r', 0);
        map.put('o', 0);
        map.put('n', 0);
        for(int i = 0; i < n; i++) {
            map.put(str.charAt(i), map.get(str.charAt(i))+1);
        }
        int zero_count=0, one_count=0;
        while(n > 0) {
            if(map.get('z') > 0 && map.get('e') > 0 && map.get('r') > 0 && map.get('o') > 0) {
                zero_count++;
                map.put('z', map.get('z')-1);
                map.put('e', map.get('e')-1);
                map.put('r', map.get('r')-1);
                map.put('o', map.get('o')-1);
                n-=4;
            } else {
                one_count++;
                map.put('e', map.get('e')-1);
                map.put('o', map.get('o')-1);
                map.put('n', map.get('n')-1);
                n-=3;
            }
        }
        while(one_count-->0) System.out.print('1' + " ");
        while(zero_count-->0) System.out.print('0' + " ");
    }
}