#include <bits/stdc++.h>
using namespace std;
void solve() {
  string s;
  cin >> s;
  vector<long long> x;
  string s2 = "0";
  s.append(s2);
  long long n = s.size();
  for (long long i = 0; i < n - 1; i++) {
    if (s[i] == '-' && s[i + 1] == '.') {
      x.push_back(1);
      i++;
    } else if (s[i] == '-' && s[i + 1] == '-') {
      x.push_back(2);
      i++;
    } else {
      x.push_back(0);
    }
  }
  for (long long i = 0; i < x.size(); i++) {
    cout << x[i];
  }
  cout << "\n";
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}

### Prompt

Generate a Cpp solution 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;
void solve() {
  string s;
  cin >> s;
  vector<long long> x;
  string s2 = "0";
  s.append(s2);
  long long n = s.size();
  for (long long i = 0; i < n - 1; i++) {
    if (s[i] == '-' && s[i + 1] == '.') {
      x.push_back(1);
      i++;
    } else if (s[i] == '-' && s[i + 1] == '-') {
      x.push_back(2);
      i++;
    } else {
      x.push_back(0);
    }
  }
  for (long long i = 0; i < x.size(); i++) {
    cout << x[i];
  }
  cout << "\n";
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}

```