Cards

Description:

Input:

The first line contains a single integer $$$n$$$ ($$$1 \leqslant n \leqslant 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.

Sample Input:

4
ezor

Sample Output:

0 

Sample Input:

10
nznooeeoer

Sample 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".