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 dp[]=new long[1000000];dp[0]=1;dp[1]=1;
            for(int i=2;i<10000;i++)
            {
                int j=2;
                while(i%j!=0&&j<=i){j++;}
                if(i==j){dp[i]=i+1;continue;}
                int temp=j;
                while(j<i){if(i%j==0)j*=temp;else break;}
                j/=temp;
                int di=i/j;
                dp[i]=(dp[j]*di)+1;
            }
        //for(int i=1;i<1000;i++)
       // {
       //     System.out.println(i+"= " +dp[i]);
       // }
        long answer=0;
        for(int i=0;i<a.length;i++)
        {
            answer+=dp[(int)a[i]];
        }
        return answer;
    }

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