def prime_delit(n):
    prime_ans = []
    for i in range(len(delit(n))):
        if isprime(delit(n)[i]):
            prime_ans.append(delit(n)[i])
    return prime_ans

for i in range(550_000 + 1, 550_000 + 10000):
    if len(delit(i)) == 0:
        F = 0
    else:
        F = sum(delit(i)) // len(delit(i))
    if F % 31 == 13:
        print(i, F)