#include <bits/stdc++.h>
using namespace std;
int main() {
  cin.tie(NULL);
  cout.tie(NULL);
  ios_base::sync_with_stdio(false);
  string s;
  cin >> s;
  map<string, char> mp;
  mp["."] = '0';
  mp["-."] = '1';
  mp["--"] = '2';
  string ss = "";
  string ans = "";
  for (int i = 0; i < s.size(); i++) {
    ss.push_back(s[i]);
    if (mp[ss]) {
      ans.push_back(mp[ss]);
      ss = "";
    }
  }
  if (ss.size() > 0) {
    reverse(s.begin(), s.end());
    ss = "";
    ans = "";
    for (int i = 0; i < s.size(); i++) {
      ss.push_back(s[i]);
      if (mp[ss]) {
        ans.push_back(mp[ss]);
        ss = "";
      }
    }
  }
  cout << ans;
  return 0;
}

### Prompt

Your challenge is to write a Cpp solution to the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  cin.tie(NULL);
  cout.tie(NULL);
  ios_base::sync_with_stdio(false);
  string s;
  cin >> s;
  map<string, char> mp;
  mp["."] = '0';
  mp["-."] = '1';
  mp["--"] = '2';
  string ss = "";
  string ans = "";
  for (int i = 0; i < s.size(); i++) {
    ss.push_back(s[i]);
    if (mp[ss]) {
      ans.push_back(mp[ss]);
      ss = "";
    }
  }
  if (ss.size() > 0) {
    reverse(s.begin(), s.end());
    ss = "";
    ans = "";
    for (int i = 0; i < s.size(); i++) {
      ss.push_back(s[i]);
      if (mp[ss]) {
        ans.push_back(mp[ss]);
        ss = "";
      }
    }
  }
  cout << ans;
  return 0;
}

```