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

public class Solution {

    static long longestSequence(long[] a) {
      int len=a.length;
            long totalsum=0;
           for(int lv=0;lv<len;lv++)
                {
                     long sum=0;
              while (a[lv]%2 == 0)
             {
                    sum=sum+a[lv];
                   a[lv]= a[lv]/2;
                     }
// n must be odd at this point.  So we can skip one element (Note i = i +2)
for (int i = 3; i <= Math.sqrt(a[lv]); i = i+2)
{
    // While i divides n, print i and divide n
    while (a[lv]%i == 0)
    {
                  sum=sum+a[lv];       
                 a[lv]= a[lv]/i;
             }
}

// This condition is to handle the case whien n is a prime number
// greater than 2
if (a[lv] > 2)
   sum=sum+a[lv];    
                        totalsum=totalsum+sum+1;
           }//for close	
    return totalsum;
    }

    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 = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}