//frequency dic, OOP-style
//enter english string
//out: гласные: a встречается n раз, и т.д.
import java.util.*;
public class StringAnalyzer {
	public static String count (String foo) {
		TreeMap<Character, Integer	> tree = new TreeMap<Character, Integer>();
		char tmp;
		int bar;
		StringBuffer result = new StringBuffer();
		for (int i=0; i<foo.length(); i++) {
			tmp = Character.toLowerCase(foo.charAt(i));
			if (tmp=='e'||tmp=='y'||tmp=='u'||tmp=='i'||tmp=='o'||tmp=='a') {
				if(tree.get(tmp) == null) {
					tree.put(tmp,1);
				} else {
					tree.put(tmp,tree.get(tmp)+1);
				}
			}
		}
		Iterator it = tree.entrySet().iterator();
		while (it.hasNext()) {
			Map.Entry en = (Map.Entry) it.next();
			result.append("(" + en.getKey() + " => " + en.getValue() + ")\n");
			//( "(" + en.getKey() + " => " + en.getValue() + ")\n" );
		}
		return result.toString();
	}
}