题解 | #完全数计算#

import sys



n = int(input())

def divisor(n):
    L=[]
    for i in range(1,n):
        if n%i ==0:
            L.append(i)
    return L

def iscompletenumber(n):
    L2=[]
    for i in range(1,n):
        if sum(divisor(i))==i:
            L2.append(i)
    print(len(L2))
    return L2


iscompletenumber(n)