#!/bin/python

import sys
import math

def prime_factors(n):
    i = 2
    factors = []
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
            factors.append(i)
    if n > 1:
        factors.append(n)
    return factors

def primes(n):
    fact=[]
    p=2
    while p<=int(math.sqrt(n)+1):
        if n%p==0:    
            fact.append(p)
            n=n/p
        else: p+=1
    if n>1: fact.append(n)
    return fact

def longestSequence(a):
    tot=0
    for b in a:
        tot+=b
        fac=prime_factors(b)
        temp=b
        for d in fac:
            temp=temp/d
            tot+=temp
    return tot


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