#!/bin/python3

import sys

def is_prime(x):
    for i in range(2, int(x**0.5)+1):
        if x % i == 0:
            return False
    return True

def longestSequence(a):
    result = 0
    for x in a:
        result += 1
        while x != 1:
            if is_prime(x):
                factor = x
            else:
                for i in range(2, x//2+1):
                    if x % i == 0 and is_prime(i):
                        factor = i
                        break
            result += x
            x = x // factor
    return result
        

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