using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Breaking_Sticks
{
    class Program
    {

        static long  Help1(long[] ar, long st, List<long> simp)
        {
            long res = -1;
            for (long i =st; i < ar.Length; i++)
            {
                if(ar[i]==0)
                {
                   res=i;
                   simp.Add(res);
                   break;
                }
            }
            return res;
        }
        static void Methed (long[] ar, List<long> simp,long st)
        {
            while (st < ar.Length)
            {
                long start = Help1(ar, st, simp);
                if (start != -1)
                {
                    Help(ar, simp, start);
                    st = start;
                }
                else
                {
                    return;
                }
            }
        }

        static void Help(long[] ar, List<long> simp, long start)
        {
            long temp = simp[simp.Count - 1];
           
            for (long i = temp; i < ar.Length;)
            {
                ar[i] = temp;
                i = i + temp;
            }
        }
        static void ForSimplNumbers(long number, List<long> num, List<long> stepen , List<long> simpl)
        {
            bool f = true;
            int i = 0;
            while(f==true)
            {
                if (number == 1)
                {
                    f = false;
                }
                else
                {
                    if (number % simpl[i] == 0)
                    {
                        num.Add(simpl[i]);
                        number = number / simpl[i];
                        stepen.Add(1);
                        while (number % simpl[i] == 0)
                        {
                            number = number /simpl[i];
                            stepen[stepen.Count-1]++;
                        }
                    }
                    else
                    {
                        i++;
                        if(i == simpl.Count && number != 1)
                        {
                            num.Add(number);
                            stepen.Add(1);
                            return;
                        }
                    }
                }
            }
        }

        static long Cnt(int count, List<long> num, List<long> stepen)
        {
            if (count == 0)
                return 1;

            if(stepen[count - 1] == 1)
            {
                stepen[count - 1] = stepen[count - 1] - 1;
                return 1 + num[count - 1] * Cnt(--count, num, stepen);
            }
            else
            {
                stepen[count - 1] = stepen[count - 1] - 1;
                return 1 + num[count - 1] * Cnt(count, num, stepen);
            }
        }

        static long CountStep2(long a, List<long> simpl)
        {
            List<long> num = new List<long>();
            List<long> stepen = new List<long>();
            ForSimplNumbers(a, num, stepen, simpl);

            return Cnt(num.Count, num, stepen);
        }

        static long CountStep(long a, List<long> simpl)
        {
            long res = 1;
            
                List<long> num = new List<long>();
                List<long> stepen = new List<long>();
                ForSimplNumbers(a, num, stepen, simpl);
                int count = num.Count;
                long temp = num[count - 1];
                if ((stepen[count - 1] - 1) == 0)
                {
                    //stepen.RemoveAt(stepen.Count - 1);
                    //num.RemoveAt(num.Count - 1);
                    count--;
                }
                else
                {
                    stepen[count - 1]--;
                }
                res = res + temp;
                while (count>0)
                {
                    long temp2 = num[count - 1];
                    if((stepen[count - 1]-1)==0)
                    {
                        //stepen.RemoveAt(stepen.Count - 1);
                        //num.RemoveAt(num.Count - 1);
                        count--;
                    }
                    else
                    {
                        stepen[count - 1]--;
                    }
                    res = res + temp2* temp;
                    temp = temp2* temp;
                }
            return res;
        }
        static long longestSequence(long[] a)
        {
            long res = 0;
            long[] allnum = new long[1000001];
            List<long> simpl = new List<long>();
            Methed(allnum, simpl, 2);
            for( long i=0;i<a.Length;i++)
            {
                if (a[i] != 1)
                {
                    long tt = CountStep2(a[i], simpl);
                    res = res + tt;
                }
                else

                res = res + 1;
            }

            return res;
            
        }


        static void Main(string[] args)
        {
            
            int n = Convert.ToInt32(Console.ReadLine());
            string[] a_temp = Console.ReadLine().Split(' ');
            long[] a = Array.ConvertAll(a_temp, Int64.Parse);
            long result = longestSequence(a);
            Console.WriteLine(result);
            


        }
    }
}