#!/bin/python3

import sys
import math
import random
def prime(n, k):
    if n == 2:
        return True

    if n % 2 == 0:
        return False

    r, s = 0, n - 1
    while s % 2 == 0:
        r += 1
        s //= 2
    for _ in range(k):
        a = random.randint(2, n - 1)
        x = pow(a, s, n)
        if x == 1 or x == n - 1:
            continue
        for _ in range(r - 1):
            x = pow(x, 2, n)
            if x == n - 1:
                break
        else:
            return False
    return True

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    max_sum=0
    for num in a:
        sum=num
        if num==1:
          max_sum+=sum
        else:
            while 1:
              if num%2==0:
                  num=num//2
                  sum+=num
              elif prime(num,10) and num!=1:
                  sum+=1
                  break
              else:
                 for j in range(2,num+1):
            
                   if num%j==0 and j%2!=0:
                      num=num//j;
                      sum+=num;
                      break;
               
             
              if num==1:
                  break;
             
            max_sum+=sum
    print (max_sum)