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

unsigned long long div(unsigned long long n)
{
    for(int i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
          return n/i;
    }
    return 1;
}
int main()
{
    unsigned long long x,i;
    cin>>x;
    unsigned long long p[x];
    for(i=0;i<x;i++)
    {
        cin>>p[i];
    }
    unsigned long long temp;
    unsigned long long sum;
    unsigned long long moves=0;
    for(i=0;i<x;i++)
    {
        if(p[i]==1)
        {
            moves++;
            continue;
        }
        temp=p[i];
        sum=0;
        while(div(temp)!=1)
        {
           sum+=div(temp);
           temp=div(temp);
        }
        moves+=sum+p[i]+1;
    }
    cout<<moves<<endl;
    return 0;
}