Самая частая буква

a = input()
ans = 0
g=''
l=''
k=''
for i in range(len(a)):
    c = a[i]
    c = a[i].lower()
    if ord(c) != 32:
        g += c
for i in g:
    b = g.count(i)
    if b>ans:
        l = i
        ans = b
print(l.upper())
print(ans)

s=input()
k=0
a=''
for i in range(len(s)):
    if ('a'<=s[i]<='z' or 'A'<=s[i]<='Z') and s.count(s[i].lower())+s.count(s[i].upper())>k:
        a=s[i].upper()
        k=s.count(s[i].lower())+s.count(s[i].upper())
    elif ('a'<=s[i]<='z' or 'A'<=s[i]<='Z') and s.count(s[i].lower())+s.count(s[i].upper())==k and a.count(s[i].upper())==0:
        a+=s[i].upper()
print(''.join(sorted(a)))
print(k)

s = input()
s = s.upper()
s = s.replace(" ", "")
r = s.count(s[0])
k = set()
for i in s:
    if "A" < i < "z":
        if r < s.count(i):
            r = s.count(i)
for i in s:
    if "A" < i < "z":
        if r == s.count(i):
            k.add(i)
print("".join(sorted(k)))
print(r)

if "A" < i < "z":

>>> 'A' <'r'
True
>>> 'A' <'r' < 'z'
True
>>> 'A' <'R' < 'z'
True
>>>

s = input().upper().replace(" ", "")
r = 0
k = set()
 
for i in s:
    if r < s.count(i):
            r = s.count(i)
 
for i in s: 
    if r == s.count(i):
        k.add(i)
print("".join(sorted(k)))
print(r)

dct = dict()
 
for el in input():
    if el.isalpha():
        dct[el] = dct.get(el, 0) + 1
        
max_count = max(dct.values())
print(''.join(sorted([k for k,v in dct.items() if v == max_count])).upper())
print(max_count)

import collections
 
list_ = "- We all live in the Yellow Submarine!".lower()
l = collections.Counter(list_).most_common()
tMax = []
vMax = 0
for t in l:
    if t[1] >= vMax and ord(t[0]) >= 97 and ord(t[0]) <= 122:
        tMax.append(t[0])
        if t[1] > vMax: vMax = t[1]
    elif t[1] < vMax:
        break
s = "".join(sorted(tMax)).upper()
print(s)
print(vMax)

EL
5

def Capitalize(S):
  for j in range(0,len(S)):
    if 97<=ord(S[j])<=122 :
      S = S[:j:] + chr(ord(S[j])-32) + S[j+1::]
  return S
H = input()
H = Capitalize(H)
 
best_n = 0
best_l = []
 
for i in H:
  
  if 65<=ord(i)<=90 : 
    n = H.count(i)
    
    if n > best_n :
      best_n = n
      best_l = i
    
    elif n == best_n :
      
      if type(best_l) == str :
        best_l = [best_l,i]
 
        if i not in best_l:
          best_l.append(i)
 
 
 
if type(best_l) == int:
  print(best_l)
 
else:
  
  out = ''
  
  for u in range(len(best_l)):
    out+=best_l[u]
  
  print(out)
 
print(best_n)

import string
 
 
def out_chr(text):
    print(max(string.ascii_lowercase, key=lambda ch: text.lower().count(ch)))
    return max(string.ascii_lowercase, key=lambda ch: text.lower().count(ch))
 
 
if __name__ == '__main__':
    text = input()
    out_chr(text)

i = input().upper()
c = 0
a = ""
for k in i:
  if k.isalpha():
    if c<i.count(k):
      c = i.count(k)
      a = k
    elif c == i.count(k) and k not in a:
      a+=k
print("".join(sorted(a)))
print(c)

g=input()
g=g.upper()
d=[chr(i) for i in range(65,91)]
ans=0
best=''
for i in range(len(d)):
    if g.count(d[i]) > ans:
        ans = g.count(d[i])
        best = d[i]
    if g.count(d[i]) == ans and best!=d[i]:
        best += d[i]
print(best)
print(ans)