#include <bits/stdc++.h>
using namespace std;
int main() {
  string str;
  cin >> str;
  int n = str.size();
  vector<int> a;
  for (unsigned i = 0; i < n;) {
    if (str[i] == '.') {
      a.push_back(0);
      i++;
    } else if (str[i] == '-' && str[i + 1] == '.') {
      a.push_back(1);
      i += 2;
    } else if (str[i] == str[i + 1]) {
      a.push_back(2);
      i += 2;
    }
  }
  for (unsigned i = 0; i < a.size(); ++i) {
    cout << a[i];
  }
}

### Prompt

Create a solution in cpp for 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() {
  string str;
  cin >> str;
  int n = str.size();
  vector<int> a;
  for (unsigned i = 0; i < n;) {
    if (str[i] == '.') {
      a.push_back(0);
      i++;
    } else if (str[i] == '-' && str[i + 1] == '.') {
      a.push_back(1);
      i += 2;
    } else if (str[i] == str[i + 1]) {
      a.push_back(2);
      i += 2;
    }
  }
  for (unsigned i = 0; i < a.size(); ++i) {
    cout << a[i];
  }
}

```