#!/bin/python

import sys
from math import sqrt
d={1:1,2:3,3:4}
def f(a):
    if a in d:
        return d[a]
    ans=a
    for i in xrange(2,int(sqrt(a))+2):
        if(a%i==0):
            x=f(a/i)
            if ans<x*i:
                ans=x*i
    d[a]=ans+1
    return ans+1

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    ans=0
    for i in a:
        ans+=f(i)
    return ans

if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(long, raw_input().strip().split(' '))
    result = longestSequence(a)
    print result
#print d