#include <bits/stdc++.h>

using namespace std;
long longestSequence(vector <long> a) {
    long res,j,k,max,p,i,fl,flag;
    res=0;
   // cout<<a.size()<<endl;
    for(i=0;i<a.size();i++)
    {max=0;

        if(a[i]%2==0)
        {
            if(a[i]==2)max=3;
           // cout<<"even"<<endl;
            
            for(j=2;j<=a[i]/2;j=j+2)
            {k=1+a[i];
                if(a[i]%j==0)
                {
                    for(long l=2;l<j;l=l*2)
                    { 
                        if(j%l==0)
                            k=k+(a[i]/l);
                    }
                  p=a[i]/j;
                    if((p+k)>max)
                        max=p+k;
                        
                }
            }
            
        }
     else
     {if(a[i]==1)
         max=1;
          
            for(j=3;j<=a[i]/2;j=j+2)
            {fl=0;flag=1;
                if(a[i]%j==0)
                {flag=0;
                    if(fl==0)
                    {fl=a[i];
                     k=1+a[i]/j+a[i];
                     max=k;
                    }
                    else
                    {  k=1+a[i];
                       for(long l=fl;l<j;l=l*fl)
                    { 
                        if(j%l==0)
                            k=k+(a[i]/l);
                    }
                  p=a[i]/j;
                    if((p+k)>max)
                        max=p+k;
                        
                    }
                }
            
            }
          if(flag==1)
                 max=a[i]+1;
         //cout<<max<<endl;
     }
    // cout<<res<<endl;
        res=res+max;
        
    }
    return res;
}
  

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;
}