#!/bin/python3

import sys

def getMovesCount(n):
    count = n
    size = 1
    flag = True
    while(flag):
        if n%2 == 0:
            size *= 2
            count += n//2
            n = n//2
        else:
            for i in range(3,n+1):
                if i%2==1 and n%i == 0:
                    size *= i
                    count += n//i
                    n= n//i
        if n == 1:flag=False
        #print(count)
        #print(n)
        #print(size)
        #print()
    return count
    


def longestSequence(a):
    count = 0
    for i in a:
        count+= getMovesCount(i)
    return count
    

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