求解这个Python

n= int(input())
t=1
sum=0
for i in range(1,n+1):
    t=t*i
    sum+=t

print(sum)

def pf(n):
    if n==1:
        return 1
    return n*pf(n-1)

n = int(input())
s = 0
for x in range(1,n+1):
    s += pf(x)
print(s)