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 totalMoves = 0;
        for(int i = 0; i < a.length; ++i){
            totalMoves += movesForCurrentLength(a[i]);
        }
        return totalMoves;
    }
    
    static long movesForCurrentLength(long a){  //
        
        if(a <= 2)
            return a;
        long moves = 1;
        for(int j = (int)a-1; j > 1; --j){
            if(a % j == 0){
                moves += j;
                for(int i = 0; i < j; ++i){   // 
                    moves += movesForCurrentLength(a/j);
                }
                return moves;
            }
        }
        return a;
    }

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