#!/bin/python3

import sys
#primes=[1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97]

def mpf(n):
    primeFactor = 1
    i = 2

    while i <= n / i:
        if n % i == 0:
            primeFactor = i
            n /= i
        else:
            i += 1

    if primeFactor < n:
        primeFactor = n

    return primeFactor

def ls(e):
    if e is 1:
        return 1
    else:
        m=mpf(e)
        if(m==e):
            return m
        else:
            return m+m*ls(e/m)
                

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result=0
    for e in a:
        if(e!=1):
            result+=1
        result+=ls(int(e))
    print(int(result))
    #print(mpf(6))