#!/bin/python3

import sys



primes = [3,2,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73]

def longestSequence(a):
    b = 0
    temp = 1
    idk = 0
    idk2 = 0
    for i in a:
        if i in primes:
            temp+=i+1
        if i == 1:
            pass
        else:
            temp+=i
            while idk != i:
                for j in primes:
                    if i%j == 0:
                        idk = j
                        break
                if i%2 == 0:
                    idk2 = int(i/idk)
                    i = int(i/idk2)
                    temp+=idk2
                else:
                    idk2 = int(i/idk)
                    i = int(i/idk)
                    temp+=idk
                temp+=i
    print(temp)            
            
            
            
            
            

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