#!/bin/python3

import sys
def maxprimeFactor(n):
    if isprime(n):
        return n
    for x in range(2,int(n ** 0.5 + 1)):
        if not n % x:
            return int(maxprimeFactor(n/x))
def isprime(n):
    for x in range(2,int(n ** 0.5 + 1)):
        if not n % x:
            return False
    return True


def longestSequence(a):
    res=0
    for i in range(len(a)):
        if a[i]==1:
            res+=1
        elif a[i]==maxprimeFactor(a[i]):
            res+=(a[i]+1)
        else:
            res+=1
            j=1
            while(a[i]!=maxprimeFactor(a[i])):
                j*=maxprimeFactor(a[i])
                a[i]/=maxprimeFactor(a[i])
                if(a[i]!=maxprimeFactor(a[i])):
                    res+=j
                
                
            res+=(j*(a[i]+1))
    return int(res)

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)