#include<bits/stdc++.h>
using namespace std;
class gh{
public:
  long long int qw;
  long long int we;
};
int main()
{
  long long int n;
  cin>>n;
  long long int arr[n];
  long long int count=0;
  for (long long int i = 0; i < n; ++i)
  {
      cin>>arr[i];
      count=count+arr[i];
  }
  
  for (long long int i = 0; i < n; ++i)
  {
      long long int a=arr[i];
      vector<pair<long long int,long long int> > whack;
      for (long long int j = 1; j*j <=a; ++j)
      {
          if(a%j==0)
          {
            whack.push_back(pair<long long int,long long int >(j,0));
            if(j*j!=a)
            {
              whack.push_back(pair<long long int,long long int >(a/j,0));
            }
          }
      }
      sort(whack.begin(),whack.end());
      whack[0].second=0;
      for(long long int j=1;j<whack.size();j++)
      {
          whack[j].second=1;
      }
      for(long long int j=1;j<whack.size();j++)
      {
          long long int op=whack[j].first;
          for(long long int k=j+1;k<whack.size();k++)
          {
             if(whack[k].first%op==0)
             {
                whack[k].second=max(whack[k].second,whack[j].second*(whack[k].first/op)+1);
             }
          }

      }

      count+=whack[whack.size()-1].second;
  }
  cout<<count<<endl;
  return 0;

}