Chef has recently been playing a lot of chess in preparation for the ICCT (International Chef Chess Tournament).
Since putting in long hours is not an easy task, Chef's mind wanders elsewhere. He starts counting the number of squares with odd side length on his chessboard..
However, Chef is not satisfied. He wants to know the number of squares of odd side length on a generic $N*N$ chessboard.

-----Input:-----
- The first line will contain a single integer $T$, the number of test cases.
- The next $T$ lines will have a single integer $N$, the size of the chess board.

-----Output:-----
For each test case, print a integer denoting the number of squares with odd length.

-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq N \leq 1000$

-----Sample Input:-----
2
3
8

-----Sample Output:-----
10
120

Starter code:

Solutions:
# cook your dish here
t=int(input())
for i in range(t):
 a=0
 n=int(input())
 while(n>0):
  a += n*n
  n=n-2
 print(a)


t=int(input())
for i in range (t):
 a=0
 n=int(input())
 while(n>0):
  a += n*n
  n=n-2
 print(a)


t=int(input())
for i in range (t):
 a=0
 n=int(input())
 while(n>0):
  a += n*n
  n=n-2
 print(a)


# cook your dish here
for _ in range(int(input())):
 n=int(input())
 s=0
 if n%2==0:
  for i in range(2,n+1,2):
   s=s+(i*i)
 else:
  for i in range(1,n+1,2):
   s=s+(i*i)
 print(s)

# cook your dish here
for i in range(int(input())):
 a=0
 n=int(input())
 while(n>0):
  a += n*n
  n=n-2
 print(a)
 


for i in range(int(input())):
 a=0
 n=int(input())
 while(n>0):
  a += n*n
  n=n-2
 print(a)

# cook your dish here
t=int(input())
for i in range(t):
 a=0
 n=int(input())
 while(n>0):
  a=a+(n*n)
  n=n-2
 print(a)

# cook your dish here
t=int(input())
for i in range(t):
 c=0
 n=int(input())
 while(n>0):
  c=c+(n*n)
  n=n-2
 print(c)

# cook your dish here
for i in range(int(input())):
 x = int(input())
 s = 0
 for i in range(1,x+1,2):
  k = x-i+1 
  s+= k*k 
 print(s)

# cook your dish here
x=int(input())
for i in range(x):
 c=0
 y=int(input())
 while(y>0):
  c=c+(y*y)
  y=y-2
 print(c)

# cook your dish here
for i in range(int(input())):
 x=int(input())
 c=0
 for i in range(1,x+1,2):
  tot=x-i+1
  c+=(tot*tot)
 print(c)

for _ in range(int(input())):
 n=int(input())
 c=0
 for i in range(1,n+1,2):
  k=n-i+1
  c+=k**2
 print(c)

t=int(input())
for _ in range(t):
 a=0
 n=int(input())
 while(n>0):
  a+=(n*n)
  n-=2
 print(a)


# cook your dish here
t=int(input())
for _ in range(t):
 s=0
 n=int(input())
 while(n>0):
  s+=(n*n)
  n-=2
 print(s)

for _ in range(int(input())):
 n=int(input())
 count=0
 for i in range(1,n+1,2):
  k=n-i+1
  count+=(k*k)
 print(count)

# cook your dish here
for _ in range(int(input())):
 n=int(input())
 count=0
 for i in range(1,n+1,2):
  k=n-i+1
  count+=(k*k)
 print(count)


t = int(input())
while t :
 n = int(input())
 count = 0
 for i in range(1 , n + 1 , 2 ) :
  count = count + ((n + 1 - i) * (n + 1 -i))
 print(count)
 t = t-1


# cook your dish here

def countSquares(n):
 return sum([(n - i + 1) ** 2 for i in range(1, n + 1, 2)])

def __starting_point():
 t = int(input())
 for i in range(t):
  n = int(input())
  print(countSquares(n))
__starting_point()

# cook your dish here
for _ in range(int(input())):
 n=int(input())
 count1=0
 for i in range(1,n+1,2):
  k=n-i+1
  count1+=k*k
 print(count1)

# cook your dish here
for _ in range(int(input())):
 n=int(input())
 cnt=0
 for i in range(1,n+1,2):
  s=n+1-i
  cnt=cnt+s*s
 print(cnt)


# cook your dish here
for _ in range(int(input())):
 n=int(input())
 count1=0
 for i in range(1,n+1,2):
  k=n-i+1
  count1+=k*k
 print(count1)

for _ in range(int(input())):
 n=int(input())
 t=n
 s=0
 while t>0:
  s=s+(t*t)
  t=t-2
 print(s)

# cook your dish here
for t in range(int(input())):
 N = int(input())
 sum = 0
 for i in range(1, N + 1, 2):
  sum += (N - i + 1) ** 2
 print(sum)


import sys
import math
import bisect
from math import factorial as fact
def input():    return sys.stdin.readline().strip()
def iinput():   return int(input())
def rinput():   return map(int, sys.stdin.readline().strip().split()) 
def get_list(): return list(map(int, sys.stdin.readline().strip().split())) 
mod = int(1e9)+7

def ncr(n, i):
 num = fact(n)
 den = fact(i)*fact(n-i)

 return num//den

for _ in range(iinput()):
 n = iinput()
 ans = 0

 for i in range(1, n+1, 2):
  ans += (n-i+1)*(n-i+1)

 print(ans) 

# cook your dish here
for _ in range(int(input())):
 n=int(input())
 count_odd_square=0
 for i in range(1,n+1,2):
  k=n-i+1
  count_odd_square+=(k*k)
 print(count_odd_square)