PROGRAMMING:Factorial Factors

 & nbsp;& nbsp;& nbsp; Given a positive integer N, we could effectively figure out all the factors of N, as $$N_{ 1}$$, $$N_{ 2}$$, ... , $$N_{ k}$$ are aggregate k factors of N(including 1 and N itself).

 & nbsp;& nbsp;& nbsp; This problem is somewhat complicated. According to these k factors, we respectively calculate up the number of factors of these factors. For example, $$N_{ 1}$$ may have $$n_{ 1}$$ factors (including 1 and $$N_{ 1}$$), $$N_{ 2}$$ may have $$n_{ 2}$$ factors, …, and $$N_{ k}$$ may have $$n_{ k}$$ factors.

 & nbsp;& nbsp;& nbsp; Now comes the problem, I want to find out the answer of S=$$n_{ 1}$$ $$^{3}$$ + $$n_{ 2}$$ $$^{3}$$ + ... + $$n_{ 3}$$ $$^{3}$$.
### Input:
 & nbsp;& nbsp;& nbsp; The first line of input there is one integer T (T<=10000)，giving the number of test cases in the input. For each test case, there is only a positive integer N (N<$$2^{31}$$).
### Output:
 & nbsp;& nbsp;& nbsp; For each test case, output one line with the answer S.
### Sample Input:
```in
two
six
nine
```
### Sample Output:
```out
eighty-one
thirty-six
```







answer：If there is no answer, please comment