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.io.*; 
import java.util.*; 
import java.util.Map.*;
import java.math.*;
//import java.lang.*;

public class q1 
{ 
    static int MOD=1000000007;
    static final int SIZE = 26;
    static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[1000000]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    }
    
    static boolean isPrime(int n) 
    { 
        if (n <= 1) 
            return false; 
        if (n <= 3) 
            return true; 
        if (n % 2 == 0 || n % 3 == 0) 
            return false; 
      
        for (int i = 5; i * i <= n; i = i + 6) 
            if (n % i == 0 ||  n % (i + 2) == 0) 
                return false; 
      
        return true; 
    } 
    static int gcd(int a, int b) 
    { 
      if (b == 0) 
        return a; 
      return gcd(b, a % b);  
    } 
    //Functions
    static int[] printCharWithFreq(String str) 
    { 
         // size of the string 'str' 
        int n = str.length(); 
  
        // 'freq[]' implemented as hash table 
        int[] freq = new int[SIZE]; 
  
        // accumulate freqeuncy of each character 
        // in 'str' 
        for (int i = 0; i < n; i++) 
            freq[str.charAt(i) - 'a']++;
        return freq; 
  
        // traverse 'str' from left to right 
        // for (int i = 0; i < n; i++) { 
  
        //     // if frequency of character str.charAt(i) 
        //     // is not equal to 0 
        //     if (freq[str.charAt(i) - 'a'] != 0) { 
  
        //         // print the character along with its 
        //         // frequency 
        //         System.out.print(str.charAt(i)); 
        //         System.out.print(freq[str.charAt(i) - 'a'] + " ");  
  
        //         // update frequency of str.charAt(i) to  
        //         // 0 so that the same character is not 
        //         // printed again 
        //         freq[str.charAt(i) - 'a'] = 0; 
        //     } 
        // } 
    } 



    
    public static void main(String[] args) throws IOException 
    { 
       Scanner sc=new Scanner(System.in); 
       //int T=sc.nextInt();
       int T=1;
       while(T-- > 0){
            int N=sc.nextInt();
            String s=sc.next();
            int freq[]=printCharWithFreq(s);
            
            int zero=freq['z' - 'a'];
            int one=freq['n' - 'a'];
            String str1 = "1";
            String str0="0";
            String repeated=String.join("", Collections.nCopies(one, str1));
            String repeated2=String.join("", Collections.nCopies(zero, str0));
           //System.out.println(repeated+repeated2);
            String st=repeated+repeated2;
            String temp="";
            for(int i=0;i<st.length();++i){
                temp+=st.charAt(i) + " ";
                //System.out.println(temp);
            }

            System.out.println(temp);
        

          
        } // End of test cases loop 

        
    }//end of main function
    
    
} //end of class q1