Given N, count all ‘a’ and ‘b’ that satisfy the condition a^3 + b^3 = N.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains integer n.
Count all 'a' and 'b' that satisfy the above equation.