/*

 冒泡排序n*(n-1)/2;

 */

 #include <iostream>

 using namespace std;

 int main()

 {

     //freopen("acm.acm","r",stdin);

     int test;

     int n;

     cin>>test;

     while(test --)

     {

         cin>>n;

         if(n% == )

         {

             cout<<(n/-)*(n/)<<endl;

         }

         else

         {

             cout<<(n/-)*(n/)/ + (n-n/-)*(n-n/)/<<endl;

         }

     }

 }