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.util.*;

   public class codechef {

			   
	   public static void main(String[] args) {
 Scanner sc = new Scanner(System.in);
 while(sc.hasNext()) {
String s = sc.next();
String s1 = "";
if(s.length() == 1) {
	if(s.charAt(0) == '.') {
		System.out.println(0);
	}
}
else if(s.length() == 2) {
	if(s.charAt(0) == '.' && s.charAt(1) == '.') {
		System.out.println(0 +""+0);
	}
	else if(s.charAt(0) == '.' && s.charAt(1) == '-') {
		System.out.println(0);
	}
	else if(s.charAt(0) == '-' && s.charAt(1) == '.') {
		System.out.println(1);
	}
	else {
		System.out.println(2);
	}
}
else {
int i = 0;
boolean a[] = new boolean[s.length()];
Arrays.fill(a, false);
while(i<s.length()-1) {
	if(s.charAt(i) == '.') {
		s1+='0';
		a[i] = true;
	i++;
	}
	else {
		if(s.charAt(i+1) == '-') {
			s1+='2';
			a[i] = true;
			a[i+1] = true;
		}
		else {
			s1+='1';
			a[i] = true;
			a[i+1] = true;
		}
		i+=2;
	}
	
}
if(s.charAt(s.length()-1) == '.' && a[s.length()-1] == false) {
	if(a[s.length()-2] == false) {
		s1+='1';
	}
	else {
		s1+='0';
	}
}
System.out.println(s1);

}	 
}
	   }
   }