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 seq = 0;
        for(int i = 0; i < a.length; i++){
            seq += findseq(a[i]);
        }
        return seq;
    }
    static long findseq(long d){
        
           if(d==1)
                return 1;
            else if(d%2 != 0)
                return (d + 1);
            else{
                long div = 3;
                long max = (1 + 2*findseq(d/2));
                while(div <= d/2){
                    if( d % div == 0){
                    long length = (1+ div*findseq(d/div));
                    if(length > max)
                        max = length;
                    }
                    div++;
                }
                return max;
            }
    }
    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();
    }
}