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

public class Solution {
   static long alll(long x,long y)
    {
        int i=2;
        long ssum =0L;
        while((y*i)<x)
        {
            if(x%(y*i) == 0)
            {   
               
                long as=x/(y*i);
               long b=y*i;
                ssum= as+alll(x,b);
               break;
            }
           
                i=i+1;
        }
        //System.out.println(ssum);
       return ssum;
    }
    static long longestSequence(long[] a) {
       
        int Length=a.length;
        long sum=0L;
            for(int i=0;i<Length;i++)
            {
                long s=0L;
                if(a[i]>1)
                    s=a[i]+1L;
                else
                    s=a[i];
                
                int rt=(int)Math.sqrt(a[i]);
                for(int j=2;j<=rt;j++)
                {
                    if(a[i]%j == 0)
                    {
                        s=s+(long)(a[i]/j);
                       s=s+alll(a[i],j);
                        break;
                    }
                }
                
                sum=sum+s;
            }
       return sum;
    }

    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();
    }
}