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

public class Solution {

    public static void main(String[] args) throws IOException
    {
        Scanner in = new Scanner(System.in);

        int n = in.nextInt();

        List<Integer> simples = new ArrayList<>();
        {
            int l = 1000000;
            boolean[] simplesBase = new boolean[l];
            Arrays.fill(simplesBase, true);
            int k;
            for (int i = 1; 2 * i * (1 + i) < l; i++)
                for (int j = i; (k = i + j + 2 * i * j) < l; j++)
                    simplesBase[k] = false;
            simples.add(2);
            for (int i = 1; i < simplesBase.length; i++)
                if (simplesBase[i])
                    simples.add(i * 2 + 1);
        }

        long res = 0;
        for (int i = 0; i < n; i++)
        {
            long val = in.nextLong();
            List<Long> dividers = new ArrayList<>();
            dividers.add(1L);
            int sqrt = (int) Math.ceil(Math.sqrt(val));
            for (int simple : simples)
            {
                if (simple > sqrt)
                    break;
                while (val % simple == 0)
                {
                    val /= simple;
                    dividers.add((long) simple);
                }
                if (val == 1)
                    break;
            }
            if (val != 1)
                dividers.add(val);

            long p = 1;
            for (int j = dividers.size() - 1; j >= 0; j--)
            {
                res += p;
                p *= dividers.get(j);
            }

        }

        System.out.println(res);

        in.close();
    }

}