In the country of Berlandia, in the city called , there is a unique tradition. If a girl wants to marry a young man, and he does not intend to give her all possible necklaces made of six beads, then she must present him with a new abelian group of order each day. Only after all possible abelian groups have been presented will the young man agree to give her a necklace every day, and eventually, they will marry. If two abelian groups are isomorphic, they are considered the same and only one of them must be presented. Athena, a girl who fell in love with a very busy programmer named Petya, wants to know how many days she needs to give him abelian groups before he agrees to give her necklaces.
Let us recall the main concepts and facts regarding abelian groups.
An abelian group is a pair G=(A,*), where is a set, and is a binary operation on , that is, for any two elements and from , the result a*b is also an element of . The following properties, called the axioms of abelian groups, must be satisfied:
(i) Associativity: For any , , in , the equality (a*b)*c = a*(b*c) holds.
(ii) There exists an element in such that for any in , a*e = e*a = a.
(iii) For any in , there exists in such that a*b = b*a = e.
(iv) Commutativity: For any in , the equality a*b = b*a holds.
An important example of an abelian group is the cyclic group of order : the set of numbers from to n-1 with addition modulo . This group is denoted by Z_n.
The direct sum of two abelian groups G=(A,*) and H=(B, \cdot) is the pair GH = (C, \times), where C = \{ (a, b) : a \in A, b \in B \} and (a_1, b_1) \times (a_2, b_2) = (a_1 * a_2, b_1 \cdot b_2) for all a_1, a_2 \in A and b_1, b_2 \in B.
Two groups G=(A,*) and H=(B,\cdot) are called isomorphic if there exists a one-to-one correspondence from to such that f(a_1) \cdot f(a_2) = f(a_1*a_2) for all a_1, a_2 \in A.
The fundamental theorem of the theory of abelian groups states that any finite abelian group is isomorphic to the direct sum of some cyclic groups.
The Chinese Remainder Theorem states that Z_{mn} is isomorphic to Z_mZ_n if and only if and are coprime.
The last two statements allow us to describe all abelian groups of order up to isomorphism.
For example, if is a prime, then all groups of order are isomorphic to Z_n.
There are non-isomorphic groups of order : Z_4 and Z_2Z_2.
There are non-isomorphic groups of order : Z_{27}, Z_9Z_3 and Z_3Z_3Z_3.
There are non-isomorphic groups of order : Z_4Z_9, Z_2Z_2Z_9, Z_4Z_3Z_3 and Z_2Z_2Z_3Z_3.
The first line of the input contains the natural number T \leq 500, the number of test cases. Each of the next lines contains a natural number N \leq 10^{18}.
For each number from the input, print on a separate line the number of abelian groups of order up to isomorphism.
Example 1