#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;

#define pb push_back
#define all(x) x.begin(),x.end() 
#define sz(x) (int)x.size()
#define fill(a,x) memset(a,x,sizeof(a)) 
#define F first
#define S second
#define FOR(i,a,b) for(int i = a; i<=b; ++i)
#define NFOR(i,a,b) for(int i = a; i>=b; --i)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
const ll INF = 1e18;
const int mod = 1e9+7;
const int N = 1e6 + 10; 
inline int add(int x,int y){
  x += y;
  if(x >= mod) x -= mod;
  return x;
}
inline int mul(int x,int y){
  x = (1LL * x * y) % mod;
  return x;
}
ll f(ll n){
  vector<pair<ll,int> > pp;
  ll nn = n;
  FOR(i,2,N - 1){
    if(n % i == 0){
      int x = 0;
      while(n % i == 0){
        n /= i;
        x += 1;
      }
      pp.pb({i,x});
    }
  }
  if(n > 1)pp.pb({n,1});
  ll ans = 0;
  n = sz(pp);
  ll last = 1;
  FOR(i,0,n-1){
    int x = pp[i].S;
    while(x--){
      last = 1 + 1LL * last * pp[i].F;
    }
  }
  return last;
}
int main(){
    fast;
    int t;cin >> t;
    ll fans = 0;
    while(t--){
      ll n;cin >> n;
      fans += f(n);
      //cout << f(n) << "\n";
    } 
    cout << fans << "\n";
    return 0; 
}