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.
The first line of input contains an integer T denoting the number of test cases.Then T test cases follow .Each test case consist of an integer N.
For each test case in a new line print the number of divisors.
1 ≤ T ≤ 50
1 ≤ N ≤ 100000
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