#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <ctype.h>
#include <queue>
#include <cstring>
#include <set>
#include <bitset>
#include <map>
#include <chrono>
#include <random>
#include <unordered_map>
#include <stdio.h>
#include <deque>
#include <iomanip>
#include <stack>
#include <cassert>
using namespace std;
using ll = long long;
#define int long long
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ain(x,n) for(int i=0;i<n;i++)cin>>x[i];
#define aout(x,n) for(int i=0;i<n;i++)cout<<x[i]<<" ";
#define pii pair<int,int>
//#define endl '\n'
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mod=1e9+7;
bool cmp(pii a,pii b)
{
    if(a.second==b.second)return a.ff>b.ff;
    return a.second<b.second;
}
void solve(int tccc)
{
    int n;
    cin>>n;
    int sm=0;
    for(int i=1;i<=n;i++)
    {
        sm+=(i-1)*n+i;
    }
    cout<<sm<<endl;
}

int32_t main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin>>t;
    for(int i=1;i<=t;i++)
    {
        solve(i);
    }

}