import numpy as np

n = int(eval(input()))

cnt = 0



for k in range(1,n+1):

    d = n//k

    if d == 1:

        cnt += (k+n)*(n-k+1)//2

        break

    cnt += k*d*(d+1)//2

print(cnt)
n = int(eval(input()))

cnts = [k*(n//k)*((n//k)+1)//2 for k in range(1,n//2+1)]

print((sum(cnts)+ ((n//2+1)+n)*(n-(n//2+1)+1)//2))
import numpy as np

n = int(eval(input()))
cnt = 0
for k in range(1, n + 1):
    d = n // k
    if d == 1:
        cnt += (k + n) * (n - k + 1) // 2
        break
    cnt += k * d * (d + 1) // 2
print(cnt)

n = int(eval(input()))
cnts = [k * (n // k) * ((n // k) + 1) // 2 for k in range(1, n // 2 + 1)]
print((sum(cnts) + ((n // 2 + 1) + n) * (n - (n // 2 + 1) + 1) // 2))

-import numpy as np - -cnt = 0 -for k in range(1, n + 1): -    d = n // k -    if d == 1: -        cnt += (k + n) * (n - k + 1) // 2 -        break -    cnt += k * d * (d + 1) // 2 -print(cnt) +cnts = [k * (n // k) * ((n // k) + 1) // 2 for k in range(1, n // 2 + 1)] +print((sum(cnts) + ((n // 2 + 1) + n) * (n - (n // 2 + 1) + 1) // 2))