DCEPCA03  Totient Extreme
Given the value of N, you will have to find the value of H. The meaning of H is given in the following code:
H=0;
For (i=1; i<=n; i++) {
For (j=1; j<=n; j++) {
H = H + totient(i) * totient(j);
}
}
Totient or phi function, φ(n) is an arithmetic function that counts the number of positive integers less than or equal to n that are relatively prime to n. That is, if n is a positive integer, then φ(n) is the number of integers k in the range 1 ≤ k ≤ n for which gcd(n, k) = 1
Constraints
0 < T <= 50
0 < N <= 10^4
Input
The first line contains T, the number of test cases. It is followed by T lines each containing a number N .
Output
For each line of input produce one line of output. This line contains the value of H for the corresponding N.
Example
Input: 2 3 10 Output: 16 1024
hide comments
bolderic:
20170821 13:14:31
it really leads me into a hole and .... 

rohit9934:
20170618 18:12:01
Study properties of ETF before attempting otherwise tle.Use pen paper to simplify.


da_201501181:
20170403 13:22:56
AC in one go..!! Very Easy..!! 

Anand:
20170124 11:21:23
Nope! It is not as easy as the comments here are describing. You will have to do some paper work, google around for the properties of phi function and then you will get the answer. Do not get carried away by those "too easy" comments! Happy Coding :) 

kira28:
20170106 20:14:53
int  WA


cat_got_bored:
20161202 22:01:14
AC in 0.0 :P Too easy really 

gautam:
20161010 20:47:55
easy one . 

Min_25:
20160725 14:00:49
@square1001


square1001:
20160725 13:51:36
It's a nice problem.


yeasintamim:
20160623 20:21:23
why TLE ??

Added by:  dce coders 
Date:  20121205 
Time limit:  0.334s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  C CSHARP CPP C++ 4.3.2 C99 HASK JAVA PASGPC PASFPC PYTHON PYTHON3 PY_NBC 
Resource:  Own Problem 