APS  Amazing Prime Sequence
Bablu is very fond of Series and Sequences...
After studying Fibonacci Series in Class IX, he was impressed and he designed his own sequence as follows...
a[0] = a[1] = 0
For n > 1, a[n] = a[n  1] + f(n), where f(n) is smallest prime factor of n.
He is also very fond of programming and thus made a small program to find a[n], but since he is in Class IX, he is not very good at programming. So, he asks you for help. Your task is to find a[n] for the above sequence....
Input
Your code will be checked for multiple Test Cases.
First Line of Input contains T (<= 100), the number of Test Cases.
Next T lines contain a single number N. (1 < N < 10^7).
Output
Single line containing a[n] i.e. nth number of the sequence for each test case.
Example
Input: 3 2 3 4 Output: 2 5 7
hide comments
chicku:
20130215 11:33:23
what it is doing in classical problem. just move it to tutorial man!!! 

Ankit Paharia:
20130215 11:33:23
very nice problem ... !!! 

:D:
20130215 11:33:23
Alex, what do you mean by bad input? Do you think there are some errors or is it simply not using extreme values for N? 

(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
20130215 11:33:23
first place :D


abdelkarim:
20130215 11:33:23
nice one . Last edit: 20130215 05:07:56 

Ehor Nechiporenko:
20130215 11:33:23
APS: Amazing problem seriously! Last edit: 20130214 20:44:59 
Added by:  c[R]@zY f[R]0G 
Date:  20130214 
Time limit:  1s 
Source limit:  5000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 