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

public class Solution {

    static long computeLongestSequence(long stickLength) {
        
        long moves = 0;
        
        long numPieces = stickLength;
        while (numPieces > 1) {
            for (long stickGroup = 2; stickGroup <= numPieces; ++stickGroup) {
                if (numPieces % stickGroup == 0) {
                    moves += numPieces;
                    numPieces = numPieces / stickGroup;
                    break;
                }
            }
        }
        ++moves;
      
        return moves;
        
    }
    
    static long longestSequence(long[] a) {
        
        long longestSeq = 0;
        
        for (long stickLength : a) {
            longestSeq += computeLongestSequence(stickLength);
        }
        
        return longestSeq;
        
    }

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