#!/bin/python3

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    totalNumber = 0
    for x in range(len(a)):
        currentStick = a[x]
        totalNumber += currentStick
        i = 2
        while(currentStick % i == 0):
            currentStick /= i
            totalNumber += currentStick
        i = 3
        while(i*i <= currentStick):
            while(currentStick%i == 0):
                currentStick /=i
                totalNumber += currentStick
            i += 2
        if (currentStick > 1):
            totalNumber += 1
    return int(totalNumber)


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