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

public class Solution {

    static long nitish(long n)
    {
        long ct = 1;
        while(n%2==0)
        {
            ct+=n;
            n /=2;
        }
        for(int i=3;i<=Math.sqrt(n);i=i+2)
        {
            while(n%i==0)
            {
                ct = ct+n;
                n/=i;
            }
        }
        if(n>2)
        {
            ct+=n;
        }
        return ct;
    }
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long count=0;
        for(int i=0;i<a.length;i++)
        {
            if(a[i]!=1)
            {
                count = count+nitish(a[i]);
            }
            else
            {
                count++;
            }
        }
        return count;
    }

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