import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        Scanner stringScan = new Scanner(System.in);

        int howManyRows = scanner.nextInt();
        String text;

        Map<Character, Integer> characters = new TreeMap<>();

        for(int i=0; i<howManyRows; i++){
            text = stringScan.nextLine();
            countCharactersInString(text, characters);
        }

        System.out.println(buildAnswer(characters));
    }

    private static void countCharactersInString(String text, Map<Character, Integer> characters){
        for(char c : text.toCharArray()){
            if((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')){
                if(characters.containsKey(c)){
                    characters.replace(c, characters.get(c) + 1);
                }
                else {
                    characters.put(c, 1);
                }
            }
        }
    }

    private static String buildAnswer(Map<Character, Integer> characters){
        StringBuilder lowerCases = new StringBuilder();
        StringBuilder upperCases = new StringBuilder();


        for(Map.Entry<Character, Integer> entry : characters.entrySet()){
            if(entry.getKey() >= 'a' && entry.getKey() <= 'z'){
                lowerCases.append(entry.getKey());
                lowerCases.append(" ");
                lowerCases.append(entry.getValue());
                lowerCases.append("\n");
            }
            else {
                upperCases.append(entry.getKey());
                upperCases.append(" ");
                upperCases.append(entry.getValue());
                upperCases.append("\n");
            }
        }

        return lowerCases.append(upperCases).toString();
    }
}