class Solution {
 public:
  int minimumKeypresses(string s) {
    int ans = 0;
    vector<int> count(26);

    for (const char c : s)
      ++count[c - 'a'];

    sort(begin(count), end(count), greater<>());

    for (int i = 0; i < 26; ++i)
      ans += count[i] * (i / 9 + 1);

    return ans;
  }
};

class Solution {
  public int minimumKeypresses(String s) {
    int ans = 0;
    Integer[] count = new Integer[26];
    Arrays.fill(count, 0);

    for (final char c : s.toCharArray())
      ++count[c - 'a'];

    Arrays.sort(count, (a, b) -> b - a);

    for (int i = 0; i < 26; ++i)
      ans += count[i] * (i / 9 + 1);

    return ans;
  }
}

class Solution:
  def minimumKeypresses(self, s: str) -> int:
    return sum(c * (i // 9 + 1)
               for i, c in enumerate(sorted(Counter(s).values(), reverse=True)))