#include <bits/stdc++.h>
using namespace std;
int main() {
  string s;
  cin >> s;
  int n = s.length();
  string q;
  for (int i = 0; i < n; i++) {
    if (s[i] == 45 && s[i + 1] == 46 && i + 1 < n) {
      q += "1";
      i++;
    } else if (s[i] == 45 && s[i + 1] == 45 && i + 1 < n) {
      q += "2";
      i++;
    } else if (s[i] == 46) {
      q += "0";
    }
  }
  cout << q << endl;
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

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() {
  string s;
  cin >> s;
  int n = s.length();
  string q;
  for (int i = 0; i < n; i++) {
    if (s[i] == 45 && s[i + 1] == 46 && i + 1 < n) {
      q += "1";
      i++;
    } else if (s[i] == 45 && s[i + 1] == 45 && i + 1 < n) {
      q += "2";
      i++;
    } else if (s[i] == 46) {
      q += "0";
    }
  }
  cout << q << endl;
  return 0;
}

```