Two friends are playing a game. One gives an integer **N** to other and asks: What is the number of divisors of N that are divisible by 3? The task is to help the other friend in finding the number of divisors.

**Input:**

The first line of input contains an integer **T** denoting the number of test cases.For each test case there will be single line which contains an integer N.

**Output:**

For each test case in a new line print the number of divisors.

**Constraints:**

1 ≤ T ≤ 50

1 ≤ N ≤ 100000

**Example:**

**Input:**

2

6

10

**Output:**

2

0

**Explanation:**

6 has three divisors 1, 3 and 6 out of which two are divisible by 3.

10 has four divisors 1,2,5 and 10 none of which is divisible by 3

Author: karanshrm44

BadiMehnatLagtiHaiEasySawalMe | 480 |

Jihye Sofia Seo | 187 |

RohitBattu | 176 |

MaaChudaApniBadiMehnatLagtiHaiEasySawal | 173 |

piyushmittal25 | 172 |

AdityaSharma16 | 490 |

BadiMehnatLagtiHaiEasySawalMe | 480 |

saumitra13325 | 452 |

blackshadows | 430 |

ashujack | 401 |

blackshadows | 5188 |

akhayrutdinov | 5099 |

Ibrahim Nash | 5071 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.