Prime Sequence

Let F(n) denote the smallest prime factor of a number n. Output A[n] = A[n-1] + F(n), given A[0] = A[1] = 0. Input - The number of test cases t is entered first. - t lines follow which are the values of n for which answer has to be found. Output - A single number for each test case which is the value of A[n] Constraints - 1 ≤ t ≤ 20 - 0 ≤ n ≤ 1000000 Example Input: 5 1 2 3 4 5 Outp