Necklace
In the country of Berlandia, in the city of N, there is a unique tradition. If a young man wants to marry a girl, he must present her with a new necklace made of six beads every day, where each bead can be painted in one of N colors. The girl will agree to marry him only after she has received all possible necklaces. If a necklace has already been given, and another necklace can be created from it by rotating or flipping, they are considered identical, and the second one does not need to be given. A young man named Anonymous has fallen in love with the beautiful Aphrodite and wishes to marry her. He now wants to determine how many days he will need to give necklaces before she agrees to marry him.
Input
The first line of the input contains a natural number T ≤ 100, representing the number of test cases. Each of the following T lines contains a natural number N < 2460.
Output
For each number N provided in the input, output on a separate line the number of distinct ways to color a necklace with six beads using N colors.