You are given a string S. Count the number of occurrences of all the digits in the string S.

Input: 
First line contains string S.

Output: 
For each digit starting from 0 to 9, print the count of their occurrences in the string S. So, print 10</math>" role="presentation" style="display: inline-block; line-height: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; relative;"><svg xmlns:xlink="http://www.w3.org/1999/xlink" width="2.325ex" height="2.014ex" viewBox="0 -750 1001 867" role="img" focusable="false" style="vertical-align: -0.272ex;" aria-hidden="true"></svg><math xmlns="http://www.w3.org/1998/Math/MathML">10</math> lines, each line containing 2 space separated integers. First integer i and second integer count of occurrence of i. See sample output for clarification.

Constraints:
1≤|S|≤100</math>" role="presentation" style="display: inline-block; line-height: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; relative;"><svg xmlns:xlink="http://www.w3.org/1999/xlink" width="13.64ex" height="2.816ex" viewBox="0 -865 5872.6 1212.2" role="img" focusable="false" style="vertical-align: -0.806ex;" aria-hidden="true"></svg><math xmlns="http://www.w3.org/1998/Math/MathML">1≤|S|≤100</math>

이게 문제애옹...


진짜 진짜 처음으로 프로그래밍 문제 풀어본거에요.... 성공해서 기뻐요!