#include<bits/stdc++.h>
using namespace std;
#define ll unsigned long long 
map <ll , ll> m;
ll cal(ll no)
{
  if(no==1)
    return 1;
  if(m[no]!=0)
    return m[no];
  vector<ll> v;
  for(ll i=1;i*i<=no;i++)
  {
      if(no%i==0)
      {
          if(no/i==i)
            v.push_back(i);
          else
          {
            v.push_back(i);
             v.push_back(no/i);
          }
      }
  }
  
  sort(v.begin(),v.end());
  ll sum=0;
  
  for(auto it=v.begin();it!=v.end()-1;it++)
  {
    if(no/(*it)==no)
      sum=no + 1;
    else 
    
    sum=max(sum,1 + (*it)*cal(no/(*it)));
     
     
    }
  m[no]=sum;
  //cout<<"ans is "<<sum<<"\n";
  return sum;
  
}
int main()
{
  int n;
  cin>>n;
  ll sum=0;
  ll arr[n];
  for(int i=0;i<n;i++)
  {
    cin>>arr[i];
    sum+=cal(arr[i]);
  }
  cout<<sum;
}