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 sum=0;
        int n;
        long m=1;
        for(int i=0;i<a.length;i++){
            System.out.println(sum);
            sum+=1;
             
            //float x=(float)Math.pow(a[i],1/2);
            n=(int)Math.sqrt(a[i]);
            int j=n;
            //System.out.println(n);
            m=1;
            while(j>=1 && a[i]!=1){
                if(a[i]%j==0){
                   // System.out.println(sum);
                    sum+=(long)(m*(a[i])/j);
                    m=(long)(a[i]/j);
                    a[i]=j;
                   
                       n=n=(int)Math.sqrt(a[i]);
                       j=n;
                    
                }
                else
                    j--;
            }
        }
        return sum;
    }

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