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.
        int i;
        long sum=0;
        int l=a.length;
        for(i=0;i<l;i++)
        {
            if(a[i]>1)
            sum+=a[i];
           long k=a[i]/2;
           while(a[i]>1 && k>1)
           {
               if(a[i]%k==0)
               {  sum+=k;
               a[i]=a[i]/2;
                k=a[i]/2;
               }
               else k--;
           }
            sum+=1;
        }
        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();
    }
}