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

public class Solution {

  static long longestSequence(long[] a) {
    long result = 0;

    for (long l : a) {
      result += solve(l);
    }

    return result;
  }

  private static long solve(long length) {
    long solution = 1;

    while (length % 2 == 0) {
      solution = 2 * solution + 1;
      length /= 2;
    }

    for (long i = 3; length > 1; i += 2) {
      if (i * i > length) {
        i = length;
      }

      while (length % i == 0) {
        solution = i * solution + 1;
        length /= i;
      }
    }

    return solution;
  }

  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();
  }
}