#include <bits/stdc++.h>
using namespace std;

int prime(long long k)
{
        for(int i=2;i<=k/2;i++)
        {
                if(k%i==0)
                        return 1;
        }
     
                return 0;
}
long long longestSequence(long long k) {
   
        long sum=0;
        int u=1,q=0,p;
      
                if(k==1)
                return 1;
                else if(k%2==0)
                        p=2;
                else if(k%2!=0)
                {
                        if(prime(k)==0)
                                return (k+1);
                        else
                                p=3;
                }
                
                        while(q<=k/2)
                        {
                        q=pow(p,u);
                        if(k%q==0&&q<=k/2)
                        {
                                if(u==1)
                                sum=sum+(k/q)+k;
                                else
                                sum=sum+(k/q);
                        }
                        q++;
                        u++;

                        }
                
        return sum+1;
}

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