#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int prime(long long int n)
{
    if(n<2)
        return 0;
    if(n==2 || n==3)
        return 1;
    if(n%2==0 || n%3==0)
        return 0;
    for(int i=5;i<=sqrt(n);i=i+6)
        if(n%i==0 || n%(i+2)==0)
            return 0;
    return 1;
}
 long int check(long int n)
{
    long int sum=n;
     //cout<<"hhhhi";
    for(long int i=n-1;i>sqrt(n-1);i--)
        if(n%i==0)
            sum+=i;
    return sum;
    
}
int main() {  
    int n;
    cin >> n;
   long long int p,sum=0;
    
  while(n--)
  {
    //cout<<"hi"  ;
     cin>>p;
      sum++;
      if(prime(p)==1)
          sum+=p;
      else
      {
          //sum+=p+1;
          sum+=check(p);
      }
      //cout<<"hiii";
  }
 cout<<sum;
    return 0;
}