import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

class Solution
{
    static boolean isPrime(long n)
    {
        if (n <= 1)  return false;
        if (n <= 3)  return true;
        if (n%2 == 0 || n%3 == 0) return false;
        for (long i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;
 
        return true;
    }

    public static void main(String[] args) 
    {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int a_i = 0; a_i < n; a_i++)
        {
            a[a_i] = in.nextLong();
        }
        long result = 0,res = 0,x,sd;
        for(int i=0;i<n;i++)
        {
            x = a[i];
            res = 0;
            sd = x;
            if(x == 1)
                res = 1;
            while(x > 1)
            {
                if(isPrime(x))
                {
                    res += x+1;
                    break;
                }
                else if(x%2 == 0)
                {
                    res += x;
                    x /= 2;
                }
                else if(x%2 == 1)
                {
                    res += x;
                    for(long j=3;j*j<=x;j+=2)
                    {
                        if(x%j == 0)
                        {
                            sd = j;
                            break;
                        }
                    }
                    x /= sd; 
                }
            }
            //System.out.println("res : "+res);
            result += res;
        }
        System.out.println(result);
        in.close();
    }
}