#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#include <memory.h>
#include <set>
#include <string.h>
#include <list>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <time.h>
#define ll long long
#define forn(i,n) for(int i=0;i<n;++i)
#define rep(i,n) for(int i=1;i<=n;++i)
#define repc(i,l,r) for(int i=l;i<=r;++i)
#define mp(a,b) make_pair(a,b)
#define llf long double
#define pii pair<int,int>
using namespace std;
void solve(){
    int n;
    cin >> n;
    ll res = 0;
    rep(i, n - 3){
        res += (ll)i*(n - 2 - i);
    }
    int k = 4;
    while (k > 1 && res % 2 == 0) {
        res /= 2;
        k /= 2;
    }
    cout << res *(n /k) +n<< endl;
}
int main(int argc,char *argv[]){
//freopen("abc.txt", "r", stdin);
    int T;
    cin >> T;
    while (T--){
        solve();
    }
    return 0;
}