#!/bin/python3

import sys
import math
def longestSequence(secuencia):
          

        sumatotal=0
        for i in secuencia:
                n=i
                inicio=n
                divisores=1
                a=[]
                lista=[]
                sumasa=0
                numero=1
                suma=0
                multiplicando=1
                for i in range(2,int(math.sqrt(n))+2):

                    a.append(i)
                a.append(n)


                while (numero!=inicio):
                      if (n%a[0]==0):
                          while n%a[0]==0:
                              n=n/a[0]
                              lista.append(a[0])
                              divisores+=a[0]
                              numero*=a[0]

                      t=a[0]
                      for j in a:
                         if (j%t==0):
                          a.remove(j)
                      suma+=1
                      a.append(inicio)

                lista.append(1)
                for i in reversed(lista):
                    multiplicando*=i
                    sumasa+=multiplicando
                sumatotal+=sumasa
        return(sumatotal)


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