import java.util.Scanner;

public class Main {
	void run() {
		Scanner scan = new Scanner(System.in);
		char[] alphabet = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
		int[] count = new int[27];

		while (scan.hasNext()) {
			String str = scan.next();
			char[] schar = str.toCharArray();
			for (char c : schar) {
				if (Character.isUpperCase(c))
					c = Character.toLowerCase(c);
				for (int i = 0; i < alphabet.length; i++)
					if (c == alphabet[i]) count[i] += 1;
			}
		}
		for (int i = 0; i < count.length - 1; i++)
			System.out.printf("%c : %d\n", alphabet[i], count[i]);
	}
	public static void main(String[] args) {
		new Main().run();
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz