/*
 * Program Description:
 * Date Created: Fri 15 Dec 2017 08:34:11 PM IST
 * Author : Stif Spear Subba
 */
import java.io.*;
import java.util.*;
class breakingstick
{
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		long sum = 0;
		for(int i=0; i<n; i++) {
			sum += get(in.nextLong());
		}
		System.out.println(sum);
	}
	public static long get(long val) {
		long sum = 1;
		while(val != 1) {
			sum += val;
			if(isPrime(val)) {
				return sum;
			}
			if(val%2 == 0) {
				val = val/2;
			} else {
				val = greatest(val);
			}
		}
		return sum;

	}
	public static boolean isPrime(long val) {
		for(int i=2;i*i<=val; i++) {
			if(val%i == 0) 
				return false;
		}
		return true;
	}
	public static long greatest(long val) {
		for(long i=val/2; i>=2; i--) {
			if(val%i == 0)
				return i;
		}
		return 0;
	}
}