Problem:
Counting Characters

Write a program which counts and reports the number of each alphabetical letter. Ignore the case of characters.

Input

A sentence in English is given in several lines.

Output

Prints the number of alphabetical letters in the following format:

a : The number of 'a'
b : The number of 'b'
c : The number of 'c'
.
.
z : The number of 'z'

Constraints

The number of characters in the sentence < 1200

Sample Input

This is a pen.

Sample Output

a : 1
b : 0
c : 0
d : 0
e : 1
f : 0
g : 0
h : 1
i : 2
j : 0
k : 0
l : 0
m : 0
n : 1
o : 0
p : 1
q : 0
r : 0
s : 2
t : 1
u : 0
v : 0
w : 0
x : 0
y : 0
z : 0

Solution in JAVA (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main{

	public static void main(String[] args) throws IOException {

		BufferedReader input = new BufferedReader(new InputStreamReader(System.in));

		// ??????????????°?????¢?????????????????????????????§????´???????array
		int[] count_array = new int[26];

		// ??°???????????¨?????¨??????????????????
		char word_a = 'a';



			// ???????????\???
			String Strings = input.readLine();

			
			// 1?????????????????¢??????????????????????????°?????°????????????????????????????´?
			char[] String_array = Strings.toCharArray();

			// ??\?????????????°??????????a~z????????£?????????????????????????????°
			int count = 0;

			// ??????String_array???????´????????????????????????????????????????????????????a~z??§???????????????
			for (int String_spot = 0; String_spot < String_array.length; String_spot++) {

				// AOJ????????¨??????????????????????????????????°??????????
				if (Character.isUpperCase(String_array[String_spot])) {

					String_array[String_spot] = Character.toLowerCase(String_array[String_spot]);

				}

				// a^z?????????????????????????´¢????????¨?????????????????????????????????
				char one_word = String_array[String_spot];

				// ?????????Z????¬??????????????????????
				word_a = 'a';

				// ??\???????????????????????????????????????????????¢?????????????????????????????????????´¢????????????
				for (int word_spot = 0; word_spot <= ('z' - 'a'); word_spot++) {

					// ??\??????????????????????????????????????¢????????????????????????????????¨?????´????????¨???
					if (one_word == word_a) {

						// ????????????
						count = 1;

						// output??¨
						count_array[word_spot] += count;

					}

					// ?¬??????????
					word_a++;

				}

			}
		

		// ?????????Z????¬??????????????????????
		word_a = 'a';

		// ??\???????????????????????????????????¢?????????????????????z
		for (int word_spot = 0; word_spot < 26; word_spot++) {

			System.out.println(word_a + " " + ":" + " " + count_array[word_spot]);

			word_a++;

		}

	}
}