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

public class Solution {

    static long maxSeq(long bar){
        long res=1;
        long[] div = new long[(int)(Math.log(bar)*2)];
        int j=divisors(0, div, bar);
        for(int i=0;i<j;i++){
            res = 1+res*div[i];
        }
        return res;
    }

    static int divisors(int i, long[] div, long bar){
        if(bar==1){
            return 0;
        }
        for(int j=2;j<Math.sqrt(bar)+1;j++){
            if(bar%j==0){
                div[i++] = j;
                return divisors(i, div, bar/j) + 1;
            }
        }
        div[i]=bar;
        return 1;
    }

    static long longestSequence(long[] a) {
        long res = 0;
        for(int i=0;i<a.length;i++){
            res+= maxSeq(a[i]);
        }
        return res;

        //  Return the length of the longest possible sequence of 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();
    }
}