#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define pb push_back
#define fst first
#define snd second

typedef long long ll;
typedef pair<int,int> pii;
template<typename T> using min_queue=priority_queue<T,vector<T>,greater<T> >;

const ll MOD=1e9+7;

int N;

int main(){
  ios::sync_with_stdio(0);cin.tie(0);

  cin>>N;
  ll res=0;
  for(int i=0;i<N;i++){
    ll a;cin>>a;
    ll d=2;
    while(a>1){
      while(d*d<=a && a%d>0) d++;
      if(d*d>a) d=a;
      res+=a;
      a/=d;
    }
    res++;
  }
  cout<<res<<'\n';
  return 0;
}