#!/bin/python

import sys
from math import sqrt
def longestSequence(l):
    steps=0
    for a in l:
        if a==1:
            steps+=1
        else:
            steps+=a
            while(True):
                f=True
                a=float(a)
                for i in range(2,int(sqrt(a))+1):
                    if(a%i==0):
                        steps+=a/i
                        a=a/i
                        f=False
                        break
                if(f):
                    steps+=1
                    break
                #print steps
    return int(steps)
        
                
        
    


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