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

    ///***********SEXY & I KNOW IT******************///
    #define uli unsigned long long int
    ///***input******// for +ve int
    inline uli in() {
        uli p=0; register char ch=0;
        while(ch<'0' or ch>'9') {ch=getchar();}
        while(ch>='0' and ch<='9') {p=(p<<1)+(p<<3)+ch-'0'; ch=getchar();}
        return p;
    }
    ///***output*****// for +ve int
    #define pc(x) putchar(x)
    inline void dukya(uli n){
            uli N = n, rev, count_ = 0;
            rev = N;
            if (N == 0) { pc('0'); pc('\n'); return ;}
            while ((rev % 10) == 0) { count_++; rev /= 10;}
            rev = 0;
            while (N != 0) { rev = (rev<<3) + (rev<<1) + N % 10; N /= 10;}
            while (rev != 0) { pc(rev % 10 + '0'); rev /= 10;}
            while (count_--) pc('0');
            pc('\n');
        }
    ///
    #define li  long long int
    #define ld  long double
    #define chal(n) for(li i=0;i<n; ++i)
    #define ot(n) cout<<n<<"\n"
    #define vi vector<li>
    #define ii pair<li, li>
    #define ict int test_case=in(); while(test_case--)
    #define INF 1000000000009
    #define mod 1000000007
    #define fastScan ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL)
    ///****************************************//
li arr[1000005];
vi primes;
li isprime[1000005];

void fun()
{
    memset(isprime, 0, sizeof isprime);
    primes.push_back(2);
    isprime[2]=1;
    for(li i=3; i<=1000000; i+=2)
    {
        if(isprime[i]==0)
        {
            primes.push_back(i);
            isprime[i]=1;
            for(li j=i*2; j<=1000000; j+=i)
                isprime[j]=-1;
        }
    }
}
int main(){
   arr[0]=0;
   arr[1]=1;
   fun();
   for(li i=2; i<=1000000; ++i)
   {
       if(isprime[i]==1)
       {
           arr[i]=i+1;
           continue;
       }
       li nx=1;
       for(li j=0; j<primes.size()&&primes[j]<=floor(i/2); ++j)
       {
           if(i%primes[j]==0)
           {
                nx=max(i/primes[j], primes[j]);
               break;
           }
       }
       arr[i]=arr[nx]+i;
   }
   //ot("x");
   li n=in();
   li ans=0;
   chal(n)
   {
       li x=in();
       while(x>1000000)
       {
           ans+=x;
           li nx=1;
           for(li j=0; j<primes.size()&&primes[j]<=floor(x/2); ++j)
           {
               if(x%primes[j]==0)
               {
                   nx=max(x/primes[j], primes[j]);
                   break;
               }
           }
           x=nx;
       }
       ans+=arr[x];
   }
   dukya(ans);
	return 0;
}