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

public class Solution {

    static long maxMoves(long n) {
        long toTheMax = 0;
        
        if (n==1)
            return 1;
        if (n==2)
            return 2;
        boolean divisible = false;
        for (int i=2; i<n; i++) {
            long potentialMax = 0;
            if (n % i == 0) {
                divisible=true;
                potentialMax=i + i*maxMoves(n / i);
                if (potentialMax>toTheMax)
                    toTheMax = potentialMax;
            }
        }
        if (!divisible)
            toTheMax = n;
        return toTheMax;                
    }
    
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        int sum=0;
        for (int i=0; i<a.length; i++) {
            long tmpsum=0;
            if (a[i]==1)
                tmpsum = 1;
            else
                tmpsum = 1+maxMoves(a[i]);
            //System.out.println("for " + a[i] + ", tmpsum="+ tmpsum);
            sum+=tmpsum;
        }
        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();
    }
}