|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Delete a node from BST|
|K’th smallest element|
|Detect cycle in a directed graph|
|Element with left side smaller and right side greater|
|Sort The Array|
|Level order traversal Line by Line|
|Add two numbers represented by linked lists|
|Root to leaf path sum|
Given a single integer N, your task is to find the sum of the square of first N odd natural Numbers.
Input : 3 Output : 35 12 + 32 + 52 = 35 Input : 8 Output : 680 12 + 32 + 52 + 72 + 92 + 112 + 132 + 152
First line of the input contains an integer T, denoting the number of test cases. Then T test case follows. The only line of each test case contains an integer N.
For each test case output the required anser on a new line.