#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {  
    int n;
    cin >> n;
  	
  	int prime[100];
  	int num=2;

  	for(int i=0;i<100;i++){

  		int counter=sqrt(num);

		for(int j=2;j<=counter;){
			if(num%j==0){
				num=num+2;
				j=2;
				counter=sqrt(num);
			}
			if(j==2){
				j++;
			}
			else{
				j=j+2;
			}
		}

		prime[i]=num;
		if(num==2){
			num++;
		}
		else{
			num=num+2;
		}
	}

/*
	for(int i=0;i<100;i++){
		cout<<prime[i]<<",";
	}
	*/
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int sum=0;
  
 	for(int i=0;i<n;i++){
 		int p=0;	
 		if(a[i]!=1){
 			for(int j=0;j<100;j++){
 				if(a[i]%prime[j]==0){
 					p=j;
 					break;
 				}
 			}

 			sum=sum+1+(a[i]/prime[p])+a[i];
 		}
 		else{
 			sum++;
 		}
 	}

 	cout<<sum;

    return 0;
}