import java.util.Scanner;

 class Breaking_sticks {

	
	static long count(long a)
	{
		if(a==1)
			return 1;
		long max=a+1;
		long c=0;
		for(long i=2;i<=a/2;i++)
		{
			if(a%i==0)
			{
				c=1+count(i)*(a/i);
			}
			if(c>max)
				max=c;
		}
		return max;
	}
		static long longestSequence(long[] a) {
			long c=0;
	      for(int i=0;i<a.length;i++)
	      {
	    	  c+=count(a[i]);
	      }
	      return c;
	    }

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

	}