题解 | #完全数计算#

def is_perfect_number(n):
    li = []
    for i in range(1, n//2 + 1):
        if n % i == 0:
            li.append(i)
    return sum(li) == n

while True:
    count = 0
    try:
        n = int(input())
    except:
        break
    for i in range(1, n):
        if is_perfect_number(i):
            count += 1
    print(count)