#!/bin/python3

import sys
from math import sqrt,ceil

#spf=[1]*1000001
#for i in range(2,1000001,2):
 #   spf[i]=2
#for i in range(3,1000001,2):
 #   if spf[i]==1:
  #      spf[i]=i
   #     for j in range(2*i,1000001,i):
    #        if spf[i]==1:
     #           spf[j]=i

def fermatfact(n,fact):
    if n==1:
        return fact
    if n%2==0:
        fact.append(2)
        n=n/2
    a=ceil(sqrt(n))
    b=a*a-n
    c=sqrt(b)
    while c!=int(c):
        a=a+1
        b=a*a-n
        c=sqrt(b)
    x1=a+c
    x2=a-c
    #print(a,':',c)
    #print(n,':',x1,';',x2)
    if x2==1:
        fact.append(int(x1))
    else:
        fact=fermatfact(x1,fact)
        fact=fermatfact(x2,fact)
    return fact


def longestSequence(a):
    if a==1:
        return 1
    b=int(ceil(sqrt(a)))
    if(sqrt(a) == ceil(sqrt(a))):
        b=b+1
    fact=list()
    for i in range(1,b):
        if a%i==0:
            fact.append(i)
            if int(a/i)!=i:
                fact.append(int(a/i))
    fact.sort()
    #for i in fact:
     #   print(i,end=' ')
    x=a
    sum=0
    for i in fact:
        if i ==1:
            sum=sum+x
            continue
        while x%i==0:
            x=int(x/i)
            sum=sum+x
    return sum




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