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

public class Solution {
    
    
    static long b = 0;
    
    static void split(long a)
    {
        if(a%2==1)
        {
            b+=a;
            return;
        }
        for(int j=2; j<=a; j++)
        {
                if((a/j)%2 == 0)
                {
                    b+=j;
                    for(int k=0; k<j; k++)
                    {
                        
                        split(a/j);
                    }
                break;
                }
            
            
            if(j==a)
            {
                b+=a;
            }
          }
    }

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        
        for(int i = 0; i<a.length; i++)
        {
            if(a[i]!=1)
            {
                b++;
                
            }
            if(a[i]%2==1)
            {
                b+=a[i];
                continue;
            }
            for(int j=2; j<a[i]; j++)
            {
                if((a[i]/j)%2==0)
                {
                    b+=j;
                    for(int k=0; k<j; k++)
                    {
                        split(a[i]/j);
                    }
                break;
                } 
                if(j==a[i])
            {
                b+=a[i];
            }
            }
            
            
            
        }
        return b;
    }

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