import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.TreeMap;
public class Main {
public static boolean deal(String s) {
if(s.charAt(s.length()-1)=='d'||s.charAt(s.length()-1)=='e') {
return true;
}
return false;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
String s=sc.nextLine();
String[] s1=s.split(",");
TreeMap<String,Integer> tmp=new TreeMap<String,Integer>();
StringBuffer sb=new StringBuffer();
for(int i=0;i<s1.length;i++) {
if(deal(s1[i])) {
if(tmp.containsKey(s1[i])) {
tmp.put(s1[i],tmp.get(s1[i])+1);
}
else {
tmp.put(s1[i],1);
}
}
}
List<Map.Entry<String, Integer>> list = new ArrayList<Map.Entry<String, Integer>>(tmp.entrySet());
Collections.sort(list, new Comparator<Map.Entry<String, Integer>>() {
//降序排序
@Override
public int compare(Entry<String, Integer> o1, Entry<String, Integer> o2) {
//return o1.getValue().compareTo(o2.getValue());
return o2.getValue().compareTo(o1.getValue());
}
});
for (Entry<String, Integer> mapping : list) {
System.out.println(mapping.getKey() + ":" + mapping.getValue());
}
/* for(String key:tmp.keySet())
{
System.out.println(key+":"+tmp.get(key));
}*/
}
}