#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) 
{
   
   
    long sum=0,prev=1;
    for(long in=0;in<a.size();in++)
    {
        // cout<<endl;
        long x=a[in];
         vector<long>s;
          for(long i=1;i*i<=x;i++)
          {
              if(x%i==0)
              {
                  if(i==(x/i) )
                      s.push_back(i);
                  else
                  {
                      s.push_back(x/i);
                      s.push_back(i);
                  }
              }
              
              // for(long j=0;j<s.size();j++)
           // cout<<s[j]<<"   ";
              
                   //cout<<endl;
          }
       sort(s.begin(),s.end());
        
       
        
        
        for(long it=0;it<s.size();it++)
        {
           
            if(s[it]==1)
            {
                prev=1;
                sum+=(x/prev);
            }
            else
            {
                if( (s[it])%prev ==0   )
                {
                    prev=(s[it]);
                     sum+=(x/prev);
                }
            }
              //cout<<"prev is"<<prev<<endl;
        }
      
        
        
    }
    return sum;
  
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}