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
#include <bits/stdc++.h>
using namespace std;
long long int finddiv(long long int n) {
  vector<long long int> div;
  for (long long int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (i == n / i)
        div.push_back(i);
      else {
        div.push_back(i);
        div.push_back(n / i);
      }
    }
  }
  sort(div.begin(), div.end());
  long long int sz = div.size();
  return sz;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int tt = 1;
  while (tt--) {
    string s;
    cin >> s;
    string ans = "";
    long long int len = s.size();
    for (long long int i = 0; i <= len - 1; i++) {
      if (s[i] == '.')
        ans += '0';
      else {
        if (s[i + 1] == '.')
          ans += '1';
        else
          ans += '2';
        i++;
      }
    }
    cout << ans;
  }
  return 0;
}
