#!/bin/python3

import sys

def half_factors(n):
    return [x for x in range(2,1+int(n**0.5)) if n%x == 0]

def longestSequence(sticks):
    all_sums = 0
    for s in sticks:
        current_sum = 0
        factors = half_factors(s)
        for f in factors:
            while s%f==0:
                current_sum += s
                s = s//f
        if s == 1:
            current_sum += 1
        else:
            current_sum += s+1
        all_sums += current_sum
    return all_sums
    #  Return the length of the longest possible sequence of moves.

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