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

public class Solution {

    static long longestSequence(long[] a) {
        int totalMoves = 0;
        for(int i = 0; i< a.length; i++){
            totalMoves+=findMaxMoves(a[i]);
        }        
        return totalMoves;
    }
    
    static long findMaxMoves(long val){
        if(val==1) return 1;
        long moves = val+1;
        boolean isDivisible = true;
        while(val>3&&isDivisible){
            isDivisible= false;
            
            for(int i = 2;i*i<=val;i++){
                if(val%i==0){
                    val=val/i;
                    isDivisible=true;
                    break;
                }
            }
            if(isDivisible){
                moves+=val;
            }
            //System.out.print(val);
        }
        return moves;
    }

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