#!/bin/python3

import sys

def longestSequence(numbers):
    steps = 0

    for i in range(len(numbers)):
        steps += steps_of_devisor(numbers[i], 0) + 1
        if numbers[i] != 1:
            steps += numbers[i]

    return steps

def steps_of_devisor(number, steps):
    for i in range(2, number // 2):
        if number % i == 0:
            current_steps = number // i
            steps += current_steps
            return steps_of_devisor(current_steps, steps) 

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