#!/bin/python3

import sys


def longestSequence(a):
    def smallestDivisor(n):
        if n % 2 == 0:
            #print("catch")
            return(2.0)
        elif n==3:
            return(3.0)
        else:
            squareRootOfn = int((n**(1/2.0)))
            for i in range(3,squareRootOfn+2,2):
                #print(i)
                #print(squareRootOfn)
                if (n % i) == 0:
                    return(i)
                else:
                    if i >= squareRootOfn:
                        #print(n)
                        return(n)

    cumsum = 0
    for num in a:
        cumsum += num
        while(num>1):
           num = num/smallestDivisor(num)
           cumsum += num
            
    return(int(cumsum))

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