跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2373. Borze

  • ID: 2379
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 表达式解析
  • 模拟
  • 字符串
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Borze

题目描述

B. Borze
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2000 题。保留原作者与原赛事署名。