TCOUNT3  Counting Triangles III
Have you felt bored when counting triangles?
Like TRICOUNT and TCOUNT2, we define the LEVEL of a triangle as in the following illustrative image:
And now we will continue defining the LEVEL of a hexagram. It's called level N hexagram if itâ€™s joined by 12 triangles, each one is a level N triangle.
Task: All you have to do is to count all triangles in the level N hexagram.
Input
The first line of the input contains an integer T  the number of test cases and T lines follow. Each line contains an integer N which is the level of the hexagram in that test case.
Output
For each test case, you should write a seperate line: the number of triangles in the level N hexagram. (All answers will fit within the range of a 64bit positive integer)
Example
Input: 1 1 Output: 20
hide comments
dwij28:
20150911 18:05:09
Cannot see the picture .. :( 

ওয়াসী (Wasi):
20130711 08:11:20
ok got ac with c++ but py2.7 gives tle :( Last edit: 20130713 16:15:04 

phpMyAdmin:
20130530 04:57:01
formula :P


Reborn In Fire...:
20100507 13:52:27
when there are such strict limits on size, atleast give some hints!!!! 
Added by:  nha.duong 
Date:  20070807 
Time limit:  1s 
Source limit:  128B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  ASM32 C CPP C99 D PASGPC PASFPC PERL PYTHON RUBY 
Resource:  Trần Huy Hưng 