s = "dda qegrjn1eroqinfnovasdoifgpqowopmadsvpmfdsdvjndsnjajnaddsjneoifioawafovsrgosriojd ff hhh tt"


def max_ausiliaria(d):
    massimo = -1
    chiave = -1
    for k in d:
        if d[k] > massimo:
            massimo = d[k]
            chiave = k

    return chiave, massimo

def isPrime(n):
    for i in range(2,n,1):
        if n % i == 0:
            return False
    return True

def f(s):
    l = s.split()
    d = {}

    for element in l:
        for c in element:
            if c in d:
                d[c] += 1
            else:
                d[c] = 1

    print(d)
    d.pop(max_ausiliaria(d)[0])
    print(d)
    d.pop(max_ausiliaria(d)[0])
    print(d)
    terzo = max_ausiliaria(d)[1]
    print(terzo)

    primes = []
    for i in range(2,terzo+1,1):
        if isPrime(i):
            primes.append(i)

    return primes