#include <bits/stdc++.h>
using namespace std;

#define Maxm 10000007
typedef long long int ll;
ll sp[Maxm];

vector<ll> primes;

void precal(){

	for(ll i=1;i<Maxm;i++){
		sp[i]=i;
	}

	for(ll i=2;i<Maxm;i++){
		if(sp[i]==i){
			for(ll j=2*i;j<Maxm;j+=i){
				sp[j]=min(i,sp[j]);
			}	
		}
	}
	
	for(int i=2;i<Maxm;i++){
	    if(sp[i]==i){
	        primes.push_back(i);
	    }
	}
}

ll solve(ll n){
	ll ans=0;
	while(1){
		if(n==1){
			//ans+=1;
			break;
		}
		n/=sp[n];
		ans+=n;
	}
	return ans;
}

ll mans=0;

ll spf(ll n){
    int i=0;
    while(primes[i]<=sqrt(n)){
        if(n%primes[i]==0){
            return primes[i];
        }
        else{
            i++;
        }
    }
    return -1;
}

ll bigDivisor(ll n){
    mans=n;
   bool flag=true;
   while(n>Maxm){
       if(spf(n)==-1){
       	   if(flag==true){
       	   	mans+=1;
       		flag=false;
       	   }
       	   else{
       	   	 mans+=(n+1);
       	   } 	
          return mans;
       }
       else{
           n/=spf(n);
           mans+=n;
       }
   }
   
   mans+=solve(n);
   return mans;
}



int main()
{   precal();
	ll t;
	cin>>t;
	ll fans=0;
    while(t--){
        ll n;
        cin>>n;
        mans=0;
        fans+=bigDivisor(n);
    }
	cout<<fans<<endl;
}