#!/bin/python3
from random import randint
from fractions import gcd

import sys
def is_prime(n):
    k=int(1000+n**0.25)
    if n <= 1 or n == 4 : return 0;
    if n <= 3 : return 1;
    while k>0:
        a = 2 + randint(0, n-3)
        if pow(a, n-1, n) != 1:
            return 0
        k-=1
    return 1;

def rho(n):
    if n%2 == 0: return 2
    if is_prime(n): return n
    while True:
        c = randint(2, n-1)
        f = lambda x: x**2 + c 
        x = y = 2 
        d = 1 
        while d == 1:
            x = f(x) % n 
            y = f(f(y)) % n 
            d = gcd((x - y) % n, n)
        if d != n: return d
        
def Div(a,d):
    if a>1:
        r=rho(a)
        #print(r,end=' ')
        if is_prime(r):
            d.append(r)
        else: Div(r,d)
        Div(int(a/r),d)

def F(a):
    if a==1:
        return 1
    if is_prime(a):
        return a+1
    d=[]
    Div(a,d)
    d=sorted(d)
    #print(d)
    sum=0
    for i in d:
        sum=(sum+1)*i
        #print(sum,end='  ')
    return 1+sum
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    sum=0
    for i in a:
        sum+=F(i)
    print(sum)