Given an integer N, determine the number of pairs (A, B) such that:

1 ≤ A, B ≤ N;
A + B is odd.

------ Input Format ------ 

- The first line of input will contain a single integer T, denoting the number of test cases.
- Each test case consists of a single integer N.

------ Output Format ------ 

For each test case, output the number of required pairs.

------ Constraints ------ 

$1 ≤ T ≤ 100$
$1 ≤ N ≤ 10^{9}$

----- Sample Input 1 ------ 
5
1
2
3
100
199

----- Sample Output 1 ------ 
0
2
4
5000
19800

----- explanation 1 ------ 
Test case $1$: There are no pairs satisfying the given conditions.

Test case $2$: The pairs satisfying both conditions are: $(1, 2)$ and $(2, 1)$.

Test case $3$: The pairs satisfying both conditions are: $(1, 2), (2, 1), (2, 3),$ and $(3, 2)$.

Difficulty: EASY

Solutions:
for i in range(int(input())):
	n = int(input())
	print(n * n // 2)


for _ in range(int(input())):
	n = int(input())
	print(2 * (n // 2) * (n - n // 2))


for _ in range(int(input())):
	neeraj = int(input())
	print(neeraj * neeraj // 2)


t = int(input())
for _ in range(t):
	N = int(input())
	(K, F) = (0, 0)
	if N % 2 == 0:
		K = N // 2
		print(2 * K * K)
	else:
		F = N // 2 + 1
		print(2 * F * (F - 1))


for _ in range(int(input())):
	samay = int(input())
	print(samay * samay // 2)


for i in range(int(input())):
	a = int(input())
	c = a * a // 2
	print(c)


for i in range(int(input())):
	a = int(input())
	ans = a * a // 2
	print(ans)


for _ in range(int(input())):
	x = int(input())
	z = x * x // 2
	print(z)


for _ in range(int(input())):
	kaushal = int(input())
	print(kaushal * kaushal // 2)


t = int(input())
for i in range(t):
	n = int(input())
	odd = n // 2
	even = odd * (n - odd) * 2
	print(even)


for _ in range(int(input())):
	N = int(input())
	print(N * N // 2)


for _ in range(int(input())):
	a = int(input())
	print(a * a // 2)


for i in range(int(input())):

	def fun(a):
		x = a * a // 2
		return x
	print(fun(int(input())))


t = int(input())
for i in range(t):
	n = int(input())
	ans = 0
	total_even = n - n // 2
	total_odd = n // 2
	print(total_even * total_odd * 2)


for i in range(int(input())):
	N = int(input())
	print(N * N // 2)


for i in range(int(input())):
	x = int(input())
	print(x * x // 2)


t = int(input())
for i in range(0, t):
	n = int(input())
	print(n * n // 2)


for _ in range(int(input())):
	k = int(input())
	print(k * k // 2)


for _ in range(int(input())):
	x = int(input())
	totalodd = x // 2
	totaleven = x - x // 2
	print(totaleven * totalodd * 2)


t = int(input())
for i in range(t):
	n = int(input())
	o = n * n // 2
	print(o)


T = int(input())
for i in range(T):
	n = int(input())
	jumlah_pasangan = n * n // 2
	print(jumlah_pasangan)


def odd_pair(n):
	return n // 2 * (n - n // 2) * 2
T = int(input())
for i in range(T):
	n = int(input())
	print(odd_pair(n))


def odd_pair(n):
	if n % 2 == 0:
		return int(n * n / 2)
	else:
		return int(n // 2) * (n - int(n // 2)) * 2
T = int(input())
for i in range(T):
	n = int(input())
	if n % 2 == 0:
		l = n // 2
	else:
		l = n // 2 + 1
	print(l * (n - l) * 2)


for i in range(int(input())):
	n = int(input())
	if n % 2 != 0:
		e = n // 2
		o = n - e
		print(e * o * 2)
	else:
		o = e = n // 2
		print(e * o * 2)


T = int(input())
for i in range(T):
	a = int(input())
	print(a * a // 2)


for _ in range(int(input())):
	aarthi = int(input())
	print(aarthi * aarthi // 2)


t = int(input())
for bunny in range(t):
	n = int(input())
	res = n * n // 2
	print(res)


for i in range(int(input())):
	n = int(input())
	if n <= 1:
		print(0)
	elif n % 2 == 0:
		e = n // 2
		print(2 * e * e)
	else:
		e = n // 2
		e1 = n - e
		print(2 * e * e1)


for i in range(int(input())):
	k = int(input())
	print(k * k // 2)


t = int(input())
for _ in range(t):
	n = int(input())
	if n % 2 == 0:
		print(2 * n // 2 * n // 2)
	else:
		print(2 * (n // 2 + 1) * (n // 2))


for t in range(int(input())):
	n = int(input())
	print(n * n // 2)


for t in range(int(input())):
	a = int(input())
	print(a * a // 2)


T = int(input())
for i in range(T):
	n = int(input())
	o = n // 2
	e = n - o
	ans = o * e * 2
	print(ans)


n = int(input())
for i in range(n):
	n = int(input())
	a = n // 2
	if n % 2 == 0:
		print(a * a * 2)
	else:
		print((a + 1) * a * 2)


T = int(input())
for t in range(T):
	N = int(input())
	if N % 2 == 0:
		count = N * N // 2
	else:
		count = (N * N - 1) // 2
	print(count)


for _ in range(int(input())):
	x = int(input())
	no_of_even_term = 0
	no_of_odd_term = 0
	if x % 2 == 0:
		no_of_even_term = int(x / 2)
		no_of_odd_term = int(x / 2)
	else:
		no_of_even_term = int(x / 2)
		no_of_odd_term = x - no_of_even_term
	if x == 2:
		print(2)
	elif x % 2 == 0:
		print(int(no_of_even_term * x))
	else:
		print(int(no_of_even_term) * 2 * no_of_odd_term)


for _ in range(int(input())):
	n = int(input())
	toteven = n // 2
	totodd = n - n // 2
	print(totodd * toteven * 2)


import math
for i in range(int(input())):
	k = int(input())
	print(k * k // 2)


for i in range(int(input())):
	n = int(input())
	total_even = n - n // 2
	total_odd = n // 2
	print(total_even * total_odd * 2)


for i in range(int(input())):
	nivetha = int(input())
	print(nivetha * nivetha // 2)


t = int(input())
while t > 0:
	n = int(input())
	print(n * n // 2)
	t = t - 1