#!/bin/python3
import sys

def longestSequence(a):
    tot=0
    for num in range(0,n):
        ans= a[num]
        cp = a[num]
        while(cp != 1):
            for i in range(2,a[num]-1):
                if(cp%i == 0):
                    break
            cp= int(cp/i)
            ans=ans+cp
        tot= tot+ans
    return tot
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)