import java.util.Scanner;

public class Solution {
	  static long longestSequence(long[] a) {
		     long j=0;
		        for(int i=0;i<a.length;i++){
		        	 double d=Math.sqrt(a[i]); 
		           if(a[i]==1)
		             j=1;  
		           else if(a[i]%2!=0 && a[i]!=1)
		              j=j+a[i]+1;
		           else if(d%2==0.0)
		              j=j+a[i]*2-1;
		           else if(a[i]%2==0 && a[i]%3==0)
		        	 j=j+a[i]*2-2;
                    else if(d%2!=0.0)
                       j=j+a[i]*2-(int)(d+1); 
		        }
		    return j;}

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