Necklace#2434
In the country of Berlandia, there is a tradition. If a young man wishes to marry a girl, he must present her with a new necklace of six beads every day, where each bead can be painted in one of colors. The girl will agree to marry him only after she receives all possible necklaces. If a necklace has already been given, and another necklace can be obtained from it by rotation or reflection, they are considered the same, and he does not need to give the second necklace. A young man named Anonymous has fallen in love with the beautiful Aphrodite and wishes to marry her. Now he wants to know how many days he will need to give necklaces before she agrees to marry him.
The first line of the input contains a natural number T \leq 100, the number of test cases. Each of the following lines contains a natural number N < 2460.
For each number in the input, output in a separate line the number of ways to color a necklace of six beads using colors.
Example 1