import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { static long longestSequence(long[] a) { // Return the length of the longest possible sequence of moves. long s =0; for(int i=0; i < a.length; i++){ s+= longestOne(a[i])+1; } return s; } static long longestOne(long a){ if(a == 1) { return 1; } else if( a == 0) return 0; else { if(a == 2){ return 2; }else{ int j=2; while(j < 10){ if((a/j) % 2 == 0 ){ long s =0; for(int k =1; k <= j; k++){ s+= longestOne(a/j) + 1; } return s; } else j++; } return 1; } } } 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(); } }