PROGRAMMING:AC Me
Ignatius is doing his homework now. The teacher gave him some articles and asked him to say the number of times each letter appeared.
It's really simple, isn't it?
###Input format:
Multiple sets of input. Each article has only one line, and all the letters are lowercase. You only need to count the number of each letter, so don't pay attention to other characters. The maximum length of the article is 100000. Process to the end of the file.
###Output format:
For each article, you have to say how many times each letter appears. The output format is similar to "X: n".
###Input example:
```in
hello, this is my first acm contest!
work hard for hdu acm.
```
###Output example:
```out
a:1
b:0
c:2
d:0
e:2
f:1
g:0
h:2
i:3
j:0
k:0
l:2
m:2
n:1
o:2
p:0
q:0
r:1
s:4
t:4
u:0
v:0
w:0
x:0
y:1
z:0
a:2
b:0
c:1
d:2
e:0
f:1
g:0
h:2
i:0
j:0
k:1
l:0
m:1
n:0
o:2
p:0
q:0
r:3
s:0
t:0
u:1
v:0
w:1
x:0
y:0
z:0
```
answer：If there is no answer, please comment
It's really simple, isn't it?
###Input format:
Multiple sets of input. Each article has only one line, and all the letters are lowercase. You only need to count the number of each letter, so don't pay attention to other characters. The maximum length of the article is 100000. Process to the end of the file.
###Output format:
For each article, you have to say how many times each letter appears. The output format is similar to "X: n".
###Input example:
```in
hello, this is my first acm contest!
work hard for hdu acm.
```
###Output example:
```out
a:1
b:0
c:2
d:0
e:2
f:1
g:0
h:2
i:3
j:0
k:0
l:2
m:2
n:1
o:2
p:0
q:0
r:1
s:4
t:4
u:0
v:0
w:0
x:0
y:1
z:0
a:2
b:0
c:1
d:2
e:0
f:1
g:0
h:2
i:0
j:0
k:1
l:0
m:1
n:0
o:2
p:0
q:0
r:3
s:0
t:0
u:1
v:0
w:1
x:0
y:0
z:0
```
answer：If there is no answer, please comment