Consecutive Factors

def solve(n):
    n = int(n)
    best_start, best_len = n, 1
    for i in range(2, int(n**0.5) + 2):
        prod = 1
        j = i
        while True:
            prod *= j
            if prod > n or n % prod != 0:
                break
            length = j - i + 1
            if length > best_len:
                best_len = length
                best_start = i
            j += 1
    print(best_len)
    print(" ".join(str(best_start + k) for k in range(best_len)))