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
rayhan50001: 2017-08-14 00:50:35

AC In One Go. 18th.. :D dp

pratham_1: 2017-07-15 17:41:13

Awesome sieve+dp:) Ac in 3 go , dont forget to use long long answers are explosive:)

rohit9934: 2017-07-11 15:41:20

sieve+pre-computation gives :)

habibpqt619: 2017-06-30 17:35:24

weak test cases

viratian_070: 2017-06-26 21:17:09

use long long int...very easy

Shubham Jadhav: 2017-05-12 07:48:02

Use long long. cost me 1 WA :)

ANKIT JAIN: 2017-05-09 20:44:39

Nice problem ..

arijit pande: 2017-04-06 20:51:56

Awesome optimisation problem.

lonelybanboo: 2017-03-30 08:04:34

And if you use 64 bit signed integers, remember to use "%lld" instead of "%d"......

stranger77: 2017-02-08 04:44:14

My 50th On spoj


Added by:c[R]@zY f[R]0G
Date:2013-02-14
Time limit:1s
Source limit:5000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64