Snowwhite

import javafx.util.Pair;
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.Scanner;

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

        LinkedHashMap<Pair<String, String>, Integer> dwarfs = new LinkedHashMap<>();
        HashMap<String, Integer> colors = new HashMap<>();

        while (true) {
            String line = scanner.nextLine();

            if (line.equals("Once upon a time"))
                break;

            String[] tokens = line.split(" <:> ");
            String dwarfName = tokens[0];
            String dwarfHatColor = tokens[1];
            Integer dwarfPhysics = Integer.parseInt(tokens[2]);

            Pair<String, String> dwarf = new Pair<>(dwarfName, dwarfHatColor);

            if (dwarfs.containsKey(dwarf)) {
                Integer oldPhysics = dwarfs.get(dwarf);
                if (dwarfPhysics > oldPhysics) {
                    dwarfs.put(dwarf, dwarfPhysics);
                }
            } else {
                dwarfs.put(dwarf, dwarfPhysics);
                colors.putIfAbsent(dwarfHatColor, 0);
                colors.put(dwarfHatColor, colors.get(dwarfHatColor) + 1);
            }
        }

        dwarfs.entrySet()
                .stream()
                .sorted((d1, d2) -> {
                    int result = Integer.compare(d2.getValue(), d1.getValue());

                    if (result == 0) {
                        result = Integer.compare(colors.get(d2.getKey().getValue()),
                                colors.get(d1.getKey().getValue()));
                    }

                    return result;
                })
                .forEach(d -> System.out.printf("(%s) %s <-> %d%n",
                        d.getKey().getValue(),
                        d.getKey().getKey(),
                        d.getValue()));
    }
}