Given N, count all ‘a’ and ‘b’ that satisfy the condition a^3 + b^3 = N.

**Input:**

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.

**Output:**

Count all 'a' and 'b' that satisfy the above equation.

**Constraints:**

1<=T<=10^5

1<=n<=10^5

**Example:
Input:**

2

9

28

**Output:**

2

2

All Is Well | 176 |

Srinivas Chakravarth | 142 |

ioan | 131 |

praveen2809 | 116 |

Diplav Srivastava | 105 |

Lam Ngoc Pham | 405 |

All Is Well | 365 |

Divvya Sinha | 356 |

skull tone | 310 |

Prateek Gole | 309 |

akhayrutdinov | 3805 |

sanjay05 | 3366 |

Michael Riegger | 2014 |

Jasleen Kaur 2 | 2012 |

Quandray | 1933 |