#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, j, N;
  char line[300];
  int op[300];
  cin >> line;
  for (i = 0, j = 0; line[i] != '\0'; i++, j++) {
    if (line[i] == '-') {
      if (line[i + 1] == '-') {
        op[j] = 2;
        i++;
      } else if (line[i + 1] == '.') {
        op[j] = 1;
        i++;
      }
    } else if (line[i] == '.')
      op[j] = 0;
    cout << op[j];
  }
  return 0;
}

### Prompt

Please create a solution in CPP 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() {
  int i, j, N;
  char line[300];
  int op[300];
  cin >> line;
  for (i = 0, j = 0; line[i] != '\0'; i++, j++) {
    if (line[i] == '-') {
      if (line[i + 1] == '-') {
        op[j] = 2;
        i++;
      } else if (line[i + 1] == '.') {
        op[j] = 1;
        i++;
      }
    } else if (line[i] == '.')
      op[j] = 0;
    cout << op[j];
  }
  return 0;
}

```