SP21615 NAJPWG - Playing with GCD

Tanmoy recently learn about Euclid gcd algorithm. This algorithm looks like: ``` gcd(a, b): if (b == 0): return a return gcd(b, a % b) ``` Now he want to find out how many pair $(x,y)$ can be possible in range $N$, which gcd is greater than $1$. Here pair $(x,y)$ and $(y,x)$ consider as same pair. $1 \le x,y \le N$. He can find out it small number easily but for a large number its really hard to find out. Now he needs your help. Write a programme that find out number of such pair.

Input start with an integer number $T \, (1 \le T \le 10^5)$, which is number of test cases. Each test case contain a integer $N \, (1 \le N \le 10^5)$.

For each case, print case number and desired answer.

**Sample** **Input** ``` 2 3 4 ``` **Output** ``` Case 1: 2 Case 2: 4 ```