#include<bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
#define sc(a) scanf("%lld", &a)
#define scs(a) scanf("%s", a)
#define prs(a) printf("%s", a)
#define prsl(a) printf("%s\n", a)
#define pr(a) printf("%lld ", a)
#define prl(a) printf("%lld\n", a)
#define rep(i, a, b) for(i=a; i<b; i++)
#define ren(i, a, b) for(i=a; i>=b; i--)
map <ll, ll> mp;
ll func(ll no){
    if(mp[no]!=0)return mp[no];
    ll s = 0, i = 0, mx = 0;
    rep(i, 1, sqrt(no)+1){
        if(no%i==0){
            //cout<<no/i<<" "<<i<<", "<<i<<" "<<no/i<<endl;
            if(i!=1)
            s = max(s, max((no/i)*func(i) + 1, i*func(no/i) + 1));
            else
                s = max(s, (no/i)*func(i) + 1);
        }
    }
    mp[no]=s;
    return s;
}
int main() {
	ll n, i, j, arr[1001];
    sc(n);
    ll sum = 0;
    rep(i, 0, n)sc(arr[i]);
    mp[1] = 1;
    mp[2] = 3;
    mp[3] = 4;
    rep(i, 0, n){
        sum+=func(arr[i]);
    }
    prl(sum);
	return 0;
}