#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

void primefactor(int num,int &t,int a[])
{   int i=2;
    while(num!=1)
    {
      if(num%i==0)
      {
          a[t]=i;
          t++;
          num=num/i;
      }
      else i++;
    }


}
int no_of_ways(int num,int y,int a[])
{   int n;
    n=num;
    int ways=0;
    while(n!=1)
    {
        ways+=num/n;
        n=n/a[y];
        y--;
    }
    return ways+num;
}
int main()
{
  int n;
  cin>>n;
  int total=0;
  for(int i=0;i<n;i++){
  int a[1000];
  for(int i=0;i<1000;i++)
    a[i]=0;
  int num,t=0;
  cin>>num;
  primefactor(num,t,a);
  total+=no_of_ways(num,t-1,a);
  }
  cout<<total;

}