#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    int t;
    cin>>t;
    ll ans=0;
    while(t--)
    {
        ll div[10005]={0},len=0;
        ll dp[10005]={0};
        ll n;
        cin>>n;
        for(int i=1;i<=sqrt(n);i++)
        {
            if(n%i==0)
            {
                div[len++] = i;
                if(i*i!=n)
                    div[len++] = n/i;
            }

        }
        sort(div,div+len);
        dp[0] = 1;
        for(int i=1;i<len;i++)
        {
            for(int j=0;j<i;j++)
            {
                if(div[i]%div[j]==0)
                    dp[i] = max(dp[i],dp[j]+div[i]);
            }
        }
        ans+=dp[len-1];
    }
    cout<<ans;
    return 0;
}