题目描述
Chef Vivek is good in mathematics and likes solving problems on prime numbers. One day his friend Jatin told him about Victory numbers. Victory number can be defined as a number formed after summing up all the prime numbers till given number n. Now, chef Vivek who is very fond of solving questions on prime numbers got busy in some other tasks. Your task is to help him finding victory number.
-----Input:-----
- First line will contain $T$, number of test cases. Then the test cases follow.
- Each test case contains of a single line of input $N$ till which sum of all prime numbers between 1 to n has to be calculated.
-----Output:-----
For each test case, output in a single line answer to the victory number.
-----Constraints-----
- $1 <= T <= 1000$
- $1 <= N <= 10^6$
-----Sample Input:-----
3
22
13
10
-----Sample Output:-----
77
41
17
输入格式
见题面
输出格式
见题面