def delit(n):
    ans = []
    d_l = 2
    while d_l * d_l <= n:
        if n % d_l == 0:
            ans.append(d_l)
            d_b = n // d_l
            if d_b != d_l:
                ans.append(d_b)
        d_l += 1
    ans.sort()
    return ans

def isprime(n):
    d_l = 2
    while d_l * d_l <= n:
        if n % d_l == 0:
            return False
        d_l += 1
    return True

count = 0
for i in range(500_000, 1, -1):
    S = sum(delit(i))
    if S != 0 and S % 10 == 0:
        print(i, S)
        count += 1
        if count == 7:
            break