//
//  Problem 2
//  by Pierre Grabolosa on 3/13/07.
//
import java.io.*;

public class problem2 {

    public static void main (String args[]) throws java.io.IOException {
	
		BufferedReader br = new BufferedReader (new InputStreamReader(System.in)); 

		System.out.println("Input to analyze:");
		String input = br.readLine();
		
		if (input.length() == 0) {
			System.out.println("\nInput is empty.");
		} else {
			// words count~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
			int count = 0;
			int inWord = 0;
			for (int i = 0 ; i < input.length(); i++) {
				if ((input.charAt(i) >= 'a' && input.charAt(i) <= 'z') ||
				    (input.charAt(i) >= 'A' && input.charAt(i) <= 'Z') || 
					(input.charAt(i) >= '0' && input.charAt(i) <= '9') )
				{
					inWord = inWord+1;
					if (inWord == 1)
						count = count +1;
				}
				else
				{
					inWord = 0;
				}
			}
			System.out.println("\nInput is " + count + " words long.");
			
			// letter frequency ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
			int freq[] = new int[26];
			
			for (int i = 0; i < 26; i++)
				freq[i] = 0;
			
			for (int i = 0 ; i < input.length(); i++) {
				if (input.charAt(i) >= 'a' && input.charAt(i) <= 'z') {
					freq[input.charAt(i) - 'a']++;
				} else if (input.charAt(i) >= 'A' && input.charAt(i) <= 'Z') {
					freq[input.charAt(i) - 'A']++;
				}
			}
			
			for (int i = 0; i < 26; i++)
				if (freq[i] > 0)
					System.out.println("" + (char)('A'+i) + " : " + freq[i]);
		}
    }
}