#include<bits/stdc++.h>

#define f(abc,start,end) for(abc=start;abc<end;abc++)
#define p(abc) cout <<#abc<< " is "<< abc <<"\n"
#define sf(abc) cin >>abc
#define P(ab,abc) cout <<#ab<< " is "<< abc <<"\n" 
#define tr(container, it)    for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define present(container, element) (container.find(element) != container.end()) 
#define cpresent(container, element) (find(all(container),element) != container.end()) 
#define ANS(ans) cout <<ans<<endl;
#define ll long long
#define ld long double
#define mod 1000000007
using namespace std;

string str,str0,s,str1,str2,str3;
long long i,j,k,l,t,m,n,x,y,z,ii,iii,ans,tt,q;
template <typename T>
void print(T p){
	
	for(auto x:p) cout<<x<<endl; //c++; if(c==n) break;}
	cout<<endl;
}
vector <ll> get(ll n){
	vector<ll> v;
	ll i=2;
	while(n>1&&i<=sqrt(n)){
		while(n%i==0) {n/=i;v.push_back(i);}
		i++;
	}
    if(n>1)
	v.push_back(n);
	return v;
}

int main()
{
	//ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    //ll starti,endi,startj,endj;
    cin>>t;
    ll fin=0;
    while(t--){
    cin>>n;
	vector <ll> v=get(n);
	//print(v);
	ans=1;
	ll res=1;
	for(auto x=v.rbegin();x!=v.rend();x++){
	ans*=*x;
	res+=ans;
    
	}
      //  p(res);
        fin+=res;
}
	ANS(fin);
    //ANS("Impossible")
   
    
}