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

public class Solution {

    static long longestSequence(long[] a) {
        long count = 0;
        for (int i = 0; i < a.length; i++) {
            long moves = longestSequence(a[i]);
            //System.out.println(moves);
            count += moves;
        }
        
        return count;
    }
    
    static long longestSequence(long size) {
        int divisor = 2;
        long unitSize = 1;
        long numPieces = size;
        long result = 0;
        while (unitSize < size) {
            //System.out.println("unitSize = " + unitSize + "; numPieces = " + numPieces + "; divisor = " + divisor);
            if (numPieces % divisor == 0) {
                long newUnitSize = (unitSize*divisor);
                result += numPieces;
                unitSize = newUnitSize;
                numPieces /= divisor;
                divisor = 2;
            }
            else if (numPieces == 1) {
                break;
            }
            else {
                divisor++;
            }
        }
        
        return result + 1;
    }

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