/*
	Swamy Saranam

	Date	: 14/12/2017 23:39:25
	Author	: Krishna Mohan A M
	Problem	:
	Status	:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int>	pii;
typedef pair<ld,ld>	pdd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef pair<ll,ll> pll;

#define FASTIO                ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b)            for(int i=(a);i<(b);i++)
#define REP(i,n)              FOR(i,0,n)
#define SORT(v)               sort((v).begin(),(v).end())
#define UN(v)                 SORT(v),(v).erase(unique((v).begin(),(v).end()),(v).end())
#define CL(a,b)               memset(a,b,sizeof a)
#define PB                    push_back
#define F                     first
#define S                     second

const int MOD = 1000000007;
const int N = 1e6+5;

bitset<N> isPrime;
vector<ll> primes;

ll n, tmp, ans;
ll memo[N];

inline void init(){
      isPrime.set();
      isPrime[0] = isPrime[1] = 0;
      for(int i=4; i<N; i+=2)
            isPrime[i] = 0;
      primes.PB(2);
      for(int i=3; i<N; i+=2){
            if(isPrime[i]){
                  primes.PB(i);
                  for(int j=2*i;j<N; j+=i)
                        isPrime[j] = 0;
            }
      }
      // cout<<primes.size()<<"\n";
}

ll solve(ll val){
      ll mval = val;
      if(val<N && memo[val] != -1)
            return memo[val];
      if(val==1)
            return 1;
      // ll divs = 1;
      ll ret = 0, mid;
      for(ll it : primes){
            if(it>val)
                  break;
            if(val%it==0){
                  // divs = it;
                  while(val%it==0)
                        val/=it;
                  mid = 1 + it * solve(mval/it);
                  ret = max(ret, mid);
                  // cout<<val<<" : "<<it<<" : "<<ret<<"\n";
            }
      }
      mid = 1 + mval;
      ret = max(ret, mid);
      if(mval<N)
            memo[mval] = ret;
      // cout<<val<<" : "<<ret<<"\n";
      return ret;
}

int main()
{
      FASTIO
      init();
      cin>>n;
      while(n--){
            CL(memo, -1);
            cin>>tmp;
            ans +=solve(tmp);
      }
      cout<<ans<<"\n";
      return 0;
}