import java.util.LinkedHashSet;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.TreeSet;


public class LogsAggregator {

    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);

        int n = Integer.parseInt(input.nextLine());
        TreeMap<TreeMap<String, Integer>, TreeSet<String>> logsMap = new TreeMap<>();
        TreeMap<String, Integer> user = new TreeMap<>();
        TreeSet<String> IPs = new TreeSet<>();

        for (int i = 0; i < n; i++) {
            String[] line = input.nextLine().split(" ");

            String IPAdress = line[0];
            String name = line[1];
            int duration = Integer.parseInt(line[2]);

            IPs.add(IPAdress);

            if (user.containsKey(name)) {
                duration += user.get(name);
                user.put(name, duration);
            } else {
                user.put(name, duration);
            }

            logsMap.put(user, IPs);

        }

        for (String string : logsMap.keySet()) { // тук не съм го редактирал
            System.out.printf("%s: %d%n", string, logsMap.get(string));
        }

        System.out.println(IPs);

    }

}