#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<cmath>#include<map>#include<set>#include<vector>#include<algorithm>#include<stack>#include<queue>#include<cctype>#include<sstream>using namespace std;#define pii pair<int,int>#define LL long long intconst double eps=1e-10;const int INF=1000000000;const int maxn=32767+10;int T,n,ans,a[maxn];int main(){    //freopen("in1.txt","r",stdin);    //freopen("out.txt","w",stdout);    a[0]=a[1]=0;    for(int i=2;i<maxn;i++)    {        a[i]=(i-1)+a[i-1];    }    cin>>T;    while(T--)    {        scanf("%d",&n);        if(n==3) cout<<1<<endl;        else if(n==1||n==2) cout<<0<<endl;        else        {            ans=a[n/2]+a[(n-n/2)/2];            cout<<ans<<endl;        }    }    //fclose(stdin);    //fclose(stdout);    return 0;}