def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    answer = 0
    for pieces in a:
        factor = 2
        while factor*factor <= pieces:
            while not pieces % factor:
                answer += pieces
                pieces = pieces // factor
            factor += 1
        answer += 1 if pieces == 1 else pieces + 1
    return answer

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