#!/bin/python

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sum=0
    for i in range(n):
        while a[i]!=1:
            sum=sum+a[i]
            fac=2
            while fac*fac<=a[i]:
                if a[i]%fac==0:
                    break
                if(fac>2):
                    fac=fac+2
                else:    
                    fac=fac+1
            if(a[i]%fac!=0):
                a[i]=1
            else:
                a[i]=a[i]/fac
        if a[i]==1:
            sum=sum+a[i]    
    return sum        

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