#include <bits/stdc++.h>

using namespace std;

int isPrime(int n)
{
    // Corner case
    if (n <= 1)  return 0;

    // Check from 2 to n-1
    for (int i=2; i<n; i++)
        if (n%i == 0)
            return 0;

    return 1;
}

long longestSequence(long a[], long n) {
    //  Return the length of the longest possible sequence of moves.
    
    long sum=0;
    for(long i = 0; i < n; i++){
         long moves=1; long x=2;long parts=1;
        long n=a[i];
        //cout<<"ip="<<isPrime(n)<<endl;
        
         if(n==1)
            {sum+=1;}
        
         if(isPrime(n)==1)
                {//cout<<"l6"<<endl;
                 // cout<<"n= "<<n<<"x= "<<x<<endl;
                 moves=moves*(n);  
                 sum+=moves;
                 // cout<<"n= "<<n<<"x= "<<x<<endl;
                }
        
        if(isPrime(n)!=1 && n!=1)
        {  // cout<<"l1"<<endl;
            while(parts!=a[i])
            {//cout<<"l2"<<endl;
                if(n%x==0)
                    {moves=(parts);
                     sum+=moves;
                     parts=n/x;
                    n=x;
                     //cout<<"haha"<<endl;
                    // cout<<"n= "<<n<<"x= "<<x<<endl;
                     x=2;
                    }
                else
                {//cout<<"l4"<<endl;
                    x++;
                }
                if(isPrime(n)==1)
                   {//cout<<"l5"<<endl;
                    sum+=parts;
                    // cout<<"n= "<<n<<"x= "<<x<<"sum="<<sum<<"moves="<<moves<<endl;
                    moves=(parts*n);
                    sum+=moves;
                    // cout<<"n= "<<n<<"x= "<<x<<"sum="<<sum<<"moves="<<moves<<endl;
                    break;
                }
            }
             
        }
        
        
       
        
        
        
       //cout<<"ind sum"<<sum<<endl;
       
    }
     return sum;
    
}

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