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 moves = 0L;

       for(int i = 0;i<a.length;i++)

       {

              if(a[i] == 1)

                    moves = moves +1;

              else

              moves = moves + (getMostMoves(a[i],a[i],a[i],2));

             

       }

       return moves;

    }

   

    static long getMostMoves(long originalLength,long presentLength, long moves,long prevNo ) {

      

       if(prevNo > originalLength/2)

       {

              if(originalLength == presentLength)

                    return moves+1;

              else

              return moves+presentLength;

       }

      

       else if(presentLength % prevNo == 0)

       {

              moves = moves+(presentLength/prevNo);

              presentLength = presentLength/prevNo;

             

              if(isPrime(presentLength))

              {

                    return moves+1;

              }

              else

              {

                    return getMostMoves(originalLength,presentLength,moves,prevNo);

              }

             

             

       }

       else if(isPrime(presentLength))

       {

              return moves+1;

       }

       else

       {

              prevNo = prevNo + 1;

              return getMostMoves(originalLength,presentLength,moves,prevNo);

       }

      

    }

   

    static boolean isPrime(long n) {

      

       if(n==1 )

              return false;

             

              if (n == 2 || n == 3)

                    return true;

              if (n % 2 == 0)

                    return false;

             

               for (int i = 2; i < Math.sqrt(n); i++) {

                     if (n % i == 0) {

                         return false;

                     }

                 }

             

              return true;

       }

 

 

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