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

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long count=0;
        for(int i=0;i<a.length;i++)
        {
            if(a[i]%2==1)
                count=count+a[i];
            else
            {
                long x=a[i]/2;
               while(x>0)
               {
                   if(x%2==1&&x!=1)
                       x--;
                   if(x==0)
                       break;
                   if(a[i]%x==0)
                   {count=count+a[i]/x;
                   x=x/2;
                   }
                   else
                       x--;
               }
                count++;
            }
        }
        return count;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        int count=0;
        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();
    }
}