#!/bin/python
from math import log,floor
import sys
def prime(a):
    if a%2==0:
        temp=1
        at=a
        while a%2==0:
            temp*=2
            a/=2
        if temp==at:
            return at/2
        else:
            return temp
    if a==1:
        return 1
    for i in range(3,int(a**0.5)+1,2):
        if a%i==0:
            return i
    return a
    
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    mem=[0 for i in range(max(a)+1)]
    mem[1]=1
    for i in range(2,max(a)+1):
        x=prime(i)
        if x==i:
            mem[i]=1+i
        elif i%2==0:
            mem[i]=1+mem[x]*(i/x)
        else:
            mem[i]=1+mem[i/x]*(x)
    s=0
    for i in a:
        s+=mem[i]
    return s
            

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