#include <bits/stdc++.h>
using namespace std;
int main() {
  int i = 0, flag = 0, k = 0;
  string s;
  cin >> s;
  int a[s.length()];
  for (int i = 0; i < s.length(); i++) {
    if (s[i] == '.') flag--;
    if (s[i] == '-') flag++;
    if (flag == -1) {
      a[k] = 0;
      flag = 0;
      k++;
      continue;
    }
    if (flag == 0) {
      a[k] = 1;
      flag = 0;
      k++;
      continue;
    }
    if (flag == 2) {
      a[k] = 2;
      flag = 0;
      k++;
      continue;
    }
  }
  for (int i = 0; i < k; i++) cout << a[i];
  return 0;
}

### 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() {
  int i = 0, flag = 0, k = 0;
  string s;
  cin >> s;
  int a[s.length()];
  for (int i = 0; i < s.length(); i++) {
    if (s[i] == '.') flag--;
    if (s[i] == '-') flag++;
    if (flag == -1) {
      a[k] = 0;
      flag = 0;
      k++;
      continue;
    }
    if (flag == 0) {
      a[k] = 1;
      flag = 0;
      k++;
      continue;
    }
    if (flag == 2) {
      a[k] = 2;
      flag = 0;
      k++;
      continue;
    }
  }
  for (int i = 0; i < k; i++) cout << a[i];
  return 0;
}

```