// Miroslaw
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<cassert>
#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
#define FOREACH(i,c) for(__typeof((c).begin())i = (c).begin();i!=(c).end(); ++i)

int cond = 1;
#define DB(X) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<" = "<<X<<endl;}}
#define DB2(X, Y) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<" = "<<X<<", "<<#Y<<" = "<<Y<<endl;}}
#define DB3(X, Y, W) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<" = "<<X<<", "<<#Y<<" = "<<Y<<", "<<#W<<" = "<<W<<endl;}}
#define DB4(X, Y, W, Z) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<" = "<<X<<", "<<#Y<<" = "<<Y<<", "<<#W<<" = "<<W<<", "<<#Z<<" = "<<Z<<endl;}}
#define DBP(X) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<" = ("<<X.first<<", "<<X.second<<")" << endl;}}
#define DBV(X) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<": ";FOREACH(__i,X)cerr<<*__i<<" ";cerr<<endl;}}

class PrimeProvider {
 public:
  PrimeProvider(int n) : pr(n + 13, true) {
    pr[0] = pr[1] = false;
    pr[2] = true;
    FOR(i, 2, n) if (pr[i]) {
      int j = 2 * i;
      while (j <= n) {
        pr[j] = false;
        j += i;
      }
    }
    FOR(i, 1, n) if (pr[i]) {
      primes.push_back(i);
    }
  }

  vector<long long> split(long long n) {
    vector<long long> v;
    int sq = sqrt(n);
    int i = 0;
    while (i < primes.size() && primes[i] <= sq) {
      while (n % primes[i] == 0) {
        n /= primes[i];
        v.push_back(primes[i]);
      }
      ++i;
    }
    if (n != 1) {
      v.push_back(n);
    }
    return v;
  }
  vector<bool> pr;
  vector<long long> primes;
};

PrimeProvider pr(1000123);

long long solve(long long x) {
  auto tmp = pr.split(x);
  LL r = 1;
  LL mno = 1;
  FORD(i, tmp.size() - 1, 0) {
    mno *= tmp[i];
    r += mno;
  }
  return r;
}


int main() {
  int T;
  scanf("%d", &T);
  long long r = 0;
  REP(i, T) {
    long long x;
    scanf("%lld", &x);
    r += solve(x);
  }
  printf("%lld\n", r);
  return 0;
}