#!/bin/python3

import sys
from math import sqrt
def largest_prime(n):
	max_prime=-1
	while(n%2==0):
		max_prime=2
		n=n/2
	i=3
	while i<=sqrt(n):
		while(n%i==0):
			max_prime=i
			n=n/i
		i+=2 
	if n>2:
		max_prime=n 
	return max_prime

def longestSequence(a):
    count=0
    for i in a:
        count=count+1
        if i==1:
            continue
        lf=largest_prime(i)
        count=count+lf
        nxtn=i/lf
        while nxtn>1:
            f=largest_prime(nxtn)
            count=count+lf*f
            lf=lf*f
            nxtn=nxtn/f
    return count
        

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