import java.util.Collections;
import java.util.HashMap;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.Set;
public class Test1 {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
SysteString string=scanner.nextLine();
char[] cha=string.toCharArray();
HashMap<Character, Integer> txt=new HashMap<Character,Integer>();
for (char c:cha) {
if (!txt.containsKey(c)) {
txt.put(c, 1);
}else {
txt.put(c, txt.get(c)+1);
}
}
for (Character key:txt.keySet()) {
System.out.println(key+"="+txt.get(key));
}
int maxnum=Collections.max(txt.values());
Set<Entry<Character, Integer>> set=txt.entrySet();
for (Entry<Character, Integer> entry:set) {
if (entry.getValue()==maxnum) {
System.out.println("出现最多的字母为:"+entry.getKey()+" 出现的次数为:"+entry.getValue());
}
}}}