#!/bin/python3

import sys

scores = {1:1, 2:3, 3:4, 4:7, 5:6, 6:10, 7:8, 8:15, 9:13}

def get_divisors(num):
    divisors = []
    for i in range(2, int(num**0.5)+1):
        if num%i == 0:
            divisors.append(i)
    new_divisors = []
    for divisor in divisors:
        if divisor * divisor != num:
            new_divisors.append(num/divisor)
    return divisors + new_divisors
    
def find_score(num):
    if num in scores:
        return scores[num]
    divisors = get_divisors(num)
    if len(divisors) == 0: #prime
        scores[num] = num + 1
        return num + 1
    best_score = 0
    for divisor in divisors:
        new_score = divisor*find_score(num/divisor) + 1
        if new_score > best_score:
            best_score = new_score
    scores[num] = best_score
    return best_score

def longestSequence(a):
    result = 0
    for piece in a:
        result += find_score(piece)
    return result

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