#!/bin/python3

import sys
import math

def longestSequence(a):
    length = 0
    for stickLen in a:
        length += stickLen
        while stickLen != 1:
            prime = True
            for i in range(2,math.ceil(math.sqrt(stickLen))):
                if stickLen % i == 0:
                    length += stickLen/i
                    stickLen /= i
                    prime = False
                    break
            if prime:
                length += 1
                break
    return int(length)

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