#include <bits/stdc++.h>
using namespace std;
#define ll long long
int tt, tc;

const int N = 101;
int dp[N][N];

void solve() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + i * j;
        }
    cout << dp[n][n] << "\n";
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    tt = 1, tc = 1; cin >> tt;
    while (tt--) solve(), tc++;
}