import java.io.*;
import java.util.*;
import java.lang.*;
class breaksticks
 {
  static long count=0L;
  public static void main(String args[])
   {
    Scanner get=new Scanner(System.in);
    long n;
    n=get.nextLong();
    for (long i=0L;i<n;i++) 
     {
      long l=get.nextLong();
      longseq(l);
     }
    System.out.println(count);
   }
  public static void longseq(long n)
   {
    if(n==1)
     count++;
    else if(isPrime(n))
      count=count+n+1;
    else
     {
      long j=1L,m,p;
      count++;
      while(true)
       {
        p=maxPrime(n);
        j=j*p;
        m=n/p;
        if(isPrime(m))
         {
          count=count+j*(m+1);
          return;
         }
        else
         {
          count=count+j;
          n=m;
         }
       }
     }
   }
 public static long maxPrime(long n)
  {
   long max=-1L;
   while(n%2L==0)
    {
     max=2L;
     n=n/2L;
    }
   for(long i=3;i<=Math.sqrt(n);i=i+2)
    {
     while(n%i==0)
      {
       max=i;
       n=n/i;
      }
    }
   if(n>2L)
    max=n;
   return max; 
  }
 public static boolean isPrime(long n)
  {
   for (long i=2L;i<=Math.sqrt(n);i++)
    if(n%i==0)
     return false;
   return true;
  }
 }