Ternary numeric notation is quite popular in Berland. To telegraph the ternary number the Borze alphabet is used. Digit 0 is transmitted as «.», 1 as «-.» and 2 as «--». You are to decode the Borze code, i.e. to find out the ternary number given its representation in Borze alphabet.

Input

The first line contains a number in Borze code. The length of the string is between 1 and 200 characters. It's guaranteed that the given string is a valid Borze code of some ternary number (this number can have leading zeroes).

Output

Output the decoded ternary number. It can have leading zeroes.

Examples

Input

.-.--


Output

012

Input

--.


Output

20

Input

-..-.--


Output

1012

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class A {

	public static void main(String[] args) throws IOException {

		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
                
                char []a=sc.next().toCharArray();
                
                String s="";
                if(a.length>1){
                    
                
                for(int i=1;i<a.length;i++){
                    if(a[i]=='-'&&a[i-1]=='-'){
                        
                        s+='2';
                        a[i]='#';
                        a[i-1]='#';
                       
                    }
                        
                    else if(a[i]=='.'&&a[i-1]=='-'){
                        s+='1';
                        a[i]='#';
                        a[i-1]='#';
                    }
                    else if(a[i]=='-'&&a[i-1]=='.'){
                        s+='0';
                        a[i-1]='#';
                        
                    }
                    else if(a[i]=='.'&&a[i-1]=='.'){
                        s+="00";
                        a[i-1]='#';
                        a[i]='#';
                        
                    }
                    else if(a[i]=='.'&&a[i-1]=='#'){
                        s+='0';
                        a[i]='#';
                    }
                      
                    
                    
                        
                        
                    
                }
                System.out.println(s);
                }
                else {
                    System.out.println("0");
                }
                
	}

	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

		public Scanner(String s) throws FileNotFoundException{	br = new BufferedReader(new FileReader(s));}

		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public int nextInt() throws IOException {return Integer.parseInt(next());}

		public long nextLong() throws IOException {return Long.parseLong(next());}

		public String nextLine() throws IOException {return br.readLine();}

		public double nextDouble() throws IOException { return Double.parseDouble(next()); }

		public boolean ready() throws IOException {return br.ready();} 
	}
}