#include<iostream>
using namespace std;
#include<vector>

   vector<long long> a;
void primefactors(long long num)
{
  long long n=num;
  
  
  long long i;
  for(i=2;i<=n/i;i++)
  {
     while(n%i==0)
     {
       a.push_back(i);
       n=n/i;
     }
  }
  if(n>1)
  a.push_back(n);
  
 
}

int main()
{

  int n;
  cin>>n;
  
  vector<long long> b;
  int z=n;
  while(z--)
  {
    long long x;
    cin>>x;
    b.push_back(x);
  }

   int i;
   long long l;
   long long ans=0;
   for(i=0;i<n;i++)
   {
      l=b[i];
      //cout<<"l "<<l<<"\n";
      a.clear();
      if(l==1)
      {
        ans=ans+1;
        continue;
      }
      primefactors(l);
      long long temp=1;
      long long mul=1;
      int rem=a.size()-1;
      
      for(int j=rem;j>0;j--)
      {
        mul=mul*a[j];
        temp=temp+mul;
      }
      
      ans=ans+temp+l;
      
   }
   cout<<ans<<"\n";


   
   /*for(int j=0;j<a.size();j++)
   cout<<a[j]<<" ";
   cout<<"\n";*/
return 0;
}