def sum1(n):

    total = 0

    i = 2

    while i * i <= n:

        if n % i == 0:

            total += i

            while n % i == 0:

                n //= i

        i += 1

    return total + n if n > 1 else total

n = int(input())

res = sum1(n)

print(res)

a, b = map(int, input().split())

save = []

for i in range(a, b + 1):

    if sum1(i) == res:

        save.append(i)

for num in save:

    print(num, end=" ")

print()

print(len(save))

A.

import math

def check(x):
    for i in range(2, int(math.sqrt(x)) + 1):
        if x % i == 0:
            return False
    return x > 1

def tu(n):
    s = 0
    for i in range(2, int(math.sqrt(n)) + 1):
        if check(i) and n % i == 0:
            s += i
            if check(n // i) and i * i <= n:
                s += n // i
    return s

n = int(input())
print(tu(n))

a, b = map(int, input().split())
d = 0
for i in range(a, b + 1):
    if tu(i) == tu(n):
        print(i, end=" ")
        d += 1
print(d)

B.