Little Monty is very fond of Fibonacci numbers and challenges his friend Lopa that he can solve any question regarding the same. Lopa however is jealous and after thinking for a long time came up with a problem.
She says given N(the number of fibonacci numbers) one has to count all the multiples of all the fibonacci numbers. This statement can be quite confusing hence look at the mathematical definition and test cases for better understanding.
Let M(x) denote the number of multiple of x in the sequence and F(y) denote the yth fibonacci number. The required answer is:
Take the first two number of the sequence to be 1 and 1.

Input Format
The first line contains T i.e. the number of test cases.
T lines follow, each line containing an integer, N.
(The sample fibonacci series for n=5 is 1, 1, 2, 3, 5)

Output Format
For each testcase, print the output that Lopa wants in one line.

Constraints
1 ≤ T ≤ 1000
1 ≤ N ≤ 1000