import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

	static long movefun(long stick)
	{
		if(stick==1)
		{
			return 1;
		}
		for(long i=stick/2;i>0;i--)
		{
			if(stick%i==0)
			{
				return stick+movefun(i);
			}
		}
		return -1;
	}
	static long longestSequence(long[] a) 
	{
		long total=0;
		for(int i=0;i<a.length;i++)
		{
			total+=movefun(a[i]);
		}
		return total;
    }

    public static void main(String[] args) 
    {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}