Cards

A. Cards

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 nn (1⩽n⩽1051⩽n⩽105) — 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 00 or "one" which corresponds to the digit 11.

Output

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

Examples

input

Copy

4
ezor

output

Copy

0 

input

Copy

10
nznooeeoer

output

Copy

1 1 0 

Note

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

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

 

把一个二进制数转换成英语单词，0是zero，1是one，给你打乱的zero和one，问你最大的原二进制数是多少。

 

只有zero里面有z，one里面有n，统计字符串中z和n出现的次数zcnt,ncnt，先输出ncnt个1，再输出zcnt个0即可。

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#define INF 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a)) 
using namespace std;
int n,ncnt,zcnt;
string s;
int main()
{
	cin>>n>>s;
	ncnt=zcnt=0;
	for(int i=0;i<n;i++)
	{
		if(s[i]=='z')
			zcnt++;
		if(s[i]=='n')
			ncnt++;
	}
	for(int i=0;i<ncnt;i++)	
		cout<<"1 ";
	for(int i=0;i<zcnt;i++)
		cout<<"0 ";
}