/***********************************************************************
    Copyright (c) 2015,wangzp
    All rights no reserved.
  
    Name: 《Crazy tea party》In PEKING UNIVERSITY ACM
    ID:   PROBLEM 1455
    问题简述:  N个人围成一圈，找出最快反着做需要调换座位的次数。
 
    Date: SEP 09, 2015 
 
***********************************************************************/
#include <stdio.h>

/*偶数个人*/
int fun_even(int n)
{
	return n/2*(n/2 - 1);
}
/*奇数个人*/
int fun_odd(int n)
{
	return (n/2)*(n/2 -1)/2 + (n/2 +1)*(n/2)/2;
}
int main(void)
{
	int m,a,result;
	scanf("%d",&m);
	while(m--)
	{
		scanf("%d",&a);
		if (a%2 == 0)
		{
			result = fun_even(a);
			printf("%d\n",result);
		} 
		else
		{
			result = fun_odd(a);
			printf("%d\n",result);
		}
	}
    return 0;
}