#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Fri Dec 15 07:36:22 2017

@author: lap10708-local
"""


def prime_factors(n):
    
    
    factors = []
    while(n%2==0):
        factors.append(2)
        n //= 2
    
    i=3
    while i * i <= n:
        if n % i:
            i += 2
        else:
            n //= i
            factors.append(i)
    if n > 1:
        factors.append(n)
    return factors

def solve(n):
    if (n==1):
        return 1
    else:
        cur = 1
        res = 1
        factor = prime_factors(n)
        for i in factor[::-1]:
            cur *= i
            res += cur
        return res
            


t = int(input())
inp = [int(i) for i in input().split()]
s = 0
for i in inp:
    s += (solve(i))

print(s)