#!/bin/python

import sys, math
def prime(n):
    if n==1:
        return False
    elif n==2:
        return True
    elif n%2==0:
        return False
    else:
        d=3
        while d*d<=n:
            if n%d==0:
                return False
            d+=2
        return True
parray=[]
for p in range(2,10**6):
    if prime(p):
        parray.append(p)
    
def singleSeq(d):
    global parray
    if d==1:
        return 1
    if prime(d):
        return d+1
    else:
        f=[]
        moves=1
        while d%2==0:
            d=d/2
            f.append(2)
        if prime(d):
            f.append(d)
        else:
            for p in parray[1:]:
                if p*p<=d:
                    while d%p==0:
                        d=d/p
                        f.append(p)
                else:
                    if prime(d):
                        f.append(d)
                        break

        m=1
        for mu in f[::-1]:
            m*=mu
            moves+=m
        return moves


def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    total=0
    for b in a:
        total+=singleSeq(b)
    return total

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