#!/bin/python3

import sys

def longestSequence(a):
    a1=list()
    for i in range(0,len(a)):
        count = int(a[i])
        num  = int(a[i])
        if num == 1:
            a1.append(count)
            continue
        while(num>2):
            for i in range(2,num-1):
                if num % int(i) == 0:
                    count = count + (num/i)
                    num = int(i)
                    break
                else:
                    count = count + 1
                    a1.append(count)
                    num = 0
                    break
    count = int(count+1)
    a1.append(count)
    return sum(a1)

    #  Return the length of the longest possible sequence of moves.

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