/*
一个正序圆圈变成一个逆序圆圈 所需的最小步骤, 在纸上模拟一下过程就能得出最佳答案。
*/
#include<cstdio>
#include<cstring>int min(int a,int b)
{
return a>b?b:a;
}
int main()
{
int t,num,n;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
if(n == 1)
{
printf("0\n");
continue;
}
num = 1;
int a,b,c,d;
/*for(int i = 2; i <= n/2; i++)
{
a = i;
b = n-i+1;
c = min(n-b+a-1,b-a);
num += c;
d = min(n-b+a,b-a-1);
num += d;
printf("%d %d %d %d\n",a,b,c,d);
}*/
if(n%2)
{
int m = n/2;
num = m*m;
}
else
{
int m = n/2-1;
num = (1+m)*m;
}
printf("%d\n",num);
}
return 0;
}