a = list(input())
c = []
while len(a) > 0:
if a[0] == '-' and a[1] == '.':
c.append("1")
del a[0:2]
elif a[0] == "-" and a[1] == "-":
c.append("2")
del a[0:2]
else:
c.append("0")
del a[0]
print("".join(c))#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin>>s;
for (int i = 0;i<s.length();i++){
if(s[i]=='.'){
cout<<"0";
}
else if (s[i]=='-'){
if( s[i+1]== '.' ){
cout<<"1";
}
else if (s[i+1]=='-' ){
cout<<"2";
}
i++;
}
}
return 0;
}566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |