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

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


        Map<String,Integer> materialMap = new LinkedHashMap<>();
        Map<String,Integer> garbageMap = new TreeMap<>();
        materialMap.put("shards",0);
        materialMap.put("fragments",0);
        materialMap.put("motes",0);
        boolean whileBreak = false;

        while(true){
            String[]data = scanner.nextLine().split("\\s+");

            for (int i = 0; i <data.length ; i+=2) {
                int quontity = Integer.parseInt(data[i]);
                String material = data[i+1].toLowerCase();

                if(materialMap.containsKey(material)) {
                    materialMap.put(material, materialMap.get(material) + quontity);
                    if(materialMap.get(material)>=250){
                        materialMap.put(material,materialMap.get(material)-250);
                        switch (material){
                            case "fragments":
                                System.out.println("Valanyr obtained!");
                                break;
                            case "shards":
                                System.out.println("Shadowmourne obtained!");
                                break;
                            case "motes":
                                System.out.println("Dragonwrath obtained!");
                                break;


                        }
                        whileBreak=true;
                        break;
                    }
                }else{
                    garbageMap.putIfAbsent(material,0);
                    garbageMap.put(material,garbageMap.get(material)+quontity);
                }

            }
            if(whileBreak==true){
                break;
            }

        }
//        for (Map.Entry<String, Integer> mMap : materialMap.entrySet()) {
//            System.out.println(mMap.getKey()+":"+mMap.getValue());
//        }

        materialMap.entrySet().stream().sorted((e1,e2) ->{
         int sort=  Integer.compare(e2.getValue(),e1.getValue());
           if(e2.getValue().compareTo(e1.getValue())==0){
              sort= e1.getKey().compareTo(e2.getKey());
           }
           return sort;
        }).forEach(e->{
            System.out.println(e.getKey()+": "+e.getValue());
        });

        garbageMap.entrySet().forEach(e->{
            System.out.println(e.getKey()+": "+e.getValue());
        });




    }
}