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 sum = 0;
        for(int i=0; i<a.length; i++) {
            sum = sum + longestCalculator(a[i]);
        }
        return sum;
    }
    
    public static long longestCalculator(long a) {
        if(a == 1) return 1;
        
        if(a%2 == 0) {
            return a + longestCalculator(a/2);
        } else 
            return a + longestCalculator(GD(a));
    }
    
    public static long GD(long a) {
        long g = a/(long)2;
        while(g > 1) {
            if(a%g == 0) return g;
            else g = g-1;
            //System.out.println(g);
        }
        
        return 1;
    }

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