#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i, j, t;
  char a[300], b[300];
  scanf("%s", a);
  t = strlen(a);
  j = 0;
  for (i = 0; i < t; i++) {
    if (a[i] == '-' && a[i + 1] == '-')
      b[j++] = '2', i++;
    else if (a[i] == '-' && a[i + 1] == '.')
      b[j++] = '1', i++;
    else if (a[i] == '.')
      b[j++] = '0';
  }
  b[j] = '\0';
  printf("%s\n", b);
  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 n, i, j, t;
  char a[300], b[300];
  scanf("%s", a);
  t = strlen(a);
  j = 0;
  for (i = 0; i < t; i++) {
    if (a[i] == '-' && a[i + 1] == '-')
      b[j++] = '2', i++;
    else if (a[i] == '-' && a[i + 1] == '.')
      b[j++] = '1', i++;
    else if (a[i] == '.')
      b[j++] = '0';
  }
  b[j] = '\0';
  printf("%s\n", b);
  return 0;
}

```