|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Even and odd elements at even and odd positions|
|Immediate Smaller Element|
|Remove every k'th node|
|Maximum of all subarrays of size k|
|Boundary Traversal of binary tree|
Given a positive integer N, calculate the sum of all prime numbers between 1 and N.
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N.
Print the sum of all prime numbers between 1 and N.
1 ≤ T ≤ 50
1 ≤ N ≤ 1000000