Perfect number

perfect.py

def sumDivs(n,accu, i):
    if i > (n//2):
        return accu
    elif n % i == 0:
        print(i)
        return sumDivs (n, accu + i , i+1)
    else :
        return sumDivs (n, accu, i+1)


x = int(input("give n ? "))

print("les diviseurs de", x, "sont :")
if x < 1:
    print("n must be > 1")
elif sumDivs(x, 0, 1) == x:
    print(x, "is perfect")
else:
    print(x, "isn't perfect")