#!/bin/python3

import sys
from math import sqrt 

d = {}
d[0] = 0;
d[1] = 1;

def largestPrimeFactor(x):
    i = 2 
    while i < x :
        if(x%i == 0):
            x = x // i 
            i -= 1
        i += 1
    return i 


def isPrime(x):
    for i in range(2, int(sqrt(x))+1):
        if(x % i == 0):
            return False
    return True 

def seq(a):
    k = 0
    t = [] 
    r = [] 
    
    try:
        o = d[a]
        return o
    except :
        pass 
    
    
    i = largestPrimeFactor(a)
    if(i == a):
        return a+1
    
    k = seq(a//i)*(i)
    
    d[a] = k + 1
    return k + 1
    
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    

    res = 0 
    k = max(a)
    
   # print(seq(8))
   # print(seq(4))
    
    for i in a:
        res += seq(i)
        
    print(res)