#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cstdint>
using namespace std;

int main() 
{  
    int n,isprime=1;
    long div;
    long c,t;
    cin >> n;
    if(n>0 && n<=100)
    {
     long a[n];
     c=0,t=0;
     long j;
     for(int i = 0; i < n; i++)
     {
        cin >> a[i];
        //cout << " a[" << i << "]:" << a[i] ;
        if(a[i]>0 && a[i]<=1000000000000)
        {
         t=0;
         if(a[i]==1)
         {
          t=1; 
          //cout << " t1:" << t ;
          c=c+t;
          //cout << " c1:" << c ;
         }
         else if(a[i]==2)
         {
          t=a[i]+1; 
          //cout << " t2:" << t ;
          c=c+t;
          //cout << " c2:" << c ;             
         }        
         else
         {
          for(j=2;j<a[i];j++)
	       {
		   if(a[i]%j==0)
            {
			isprime=0;
		    //cout << " j:" << j;
            break;
		    }
	       }
          if(isprime == 1)
           {
          t=a[i]+1;
          //cout << " t3:" << t ;
          c=c+t;
          //cout << " c3:" << c ;
           }
          else
           {
          t=a[i];
          //cout << " j:" << j;
          div=a[i]/j;
          //cout << " div:" << div;
          t=t+div;
          //cout << " t:" << t ;
          while(div!=1)
           {
          for(long k=j;k<=div;k++)
	        {
		   while(div%k==0)
             {
            div=div/k;
            //cout << " div:" << div;
            t=t+div;
		    //cout << " k:" << k;
            //cout << " t4:" << t ;
		     }
	        }
           } 
           c=c+t;      
           //cout << " c4:" << c ;
          }
         }
                  
        }
     }   
       cout << c << endl;
    } 
    return 0;
}