// ayy // ' lamo // SUBLIME HAX #include using namespace std; template ostream &operator<<(ostream &os,const pair &x) { return os<<"("< struct is_iterable { template static long check(...); template static char check(int, typename T::const_iterator = C().end()); enum { value = sizeof(check(0)) == sizeof(char), neg_value = sizeof(check(0)) != sizeof(char) }; }; template ostream &_out_str(ostream &os,const T &x) { return os<<'"'< ostream &_dbg2_5(ostream &,const T &); template using eit=typename enable_if::type; template inline ostream &_dbg3(ostream &os,eit::neg_value,const T> &x) { return os< inline ostream &_dbg3(ostream &os,eit::value,const T> &V) { os<<"{"; bool ff=0; for(const auto &E:V) _dbg2_5(ff?os<<",":os,E), ff=1; return os<<"}"; } template<> inline ostream &_dbg3(ostream &os,const string &x) { return _out_str(os,x); } template<> inline ostream &_dbg3(ostream &os,const char *const &x) { return _out_str(os,x); } template inline ostream &_dbg2_5(ostream &os,const T &x) { return _dbg3(os,x); } template ostream &_dbg2(ostream &os,vector::iterator nm,const T &x,Args&&... args); inline ostream &_dbg2(ostream &os,vector::iterator) { return os; } template inline ostream &_dbg2(ostream &os,vector::iterator nm,const char *x,Args&&... args) { return _dbg2(_dbg3(os<<" ",x),nm+1,args...); } template inline ostream &_dbg2(ostream &os,vector::iterator nm,const T &x,Args&&... args) { return _dbg2(_dbg3(os<<" "<<*nm<<"=",x),nm+1,args...); } vector split(string s) { vector Z; string z=""; s+=','; int dep=0; for(char c:s) { if(c==',' && !dep) Z.push_back(z),z=""; else z+=c; if(c=='(') ++dep; if(c==')') --dep; } return Z; } template inline ostream &_dbg1(int ln,const string &nm,Args&&... args) { auto nms=split(nm); return _dbg2(cerr<<"L"< // using namespace __gnu_pbds; typedef unsigned long long ull; typedef long long ll; typedef long double ld; //CARE typedef complex pt; const ld eps=(ld)1e-8; const ld tau=2*(ld)acosl(-1); const int inf=1e9+99; const ll linf=1e18+99; const int P=1e9+7; ll g(ll x) { vector pf; for(ll d=2;d*d<=x;d++) { for(;!(x%d);) pf.pb(d), x/=d; } if(x>1) pf.pb(x); sort(pf.rbegin(),pf.rend()); ll pc=1; ll Z=0; for(ll d:pf) { Z+=pc; pc*=d; } return Z+pc; } int32_t main() { ll Z=0; int n; cin>>n; for(;n--;) { ll x; cin>>x; Z+=g(x); } cout<