#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#define Size 105
#define LL long long
#define ULL unsigned long long
#define Mod 1000000007
using namespace std;
int n,m,k;
unsigned long long ans[100005];
void init()
{
    ans[2]=2;
    ans[3]=3;
    ans[4]=5;
    for(int i=5;i<=100000;++i)
    {
        ULL n=i-3;
        ans[i]=ans[i-1]+1+(n)*(n+1)*(n+1)/2;
        ans[i]=ans[i]-(n)*(n+1)*(2*n+1)/6;
    }
}
int main()
{
    #ifndef ONLINE_JUDGE
//        freopen("input.txt","r",stdin);
//        freopen("output.txt","w",stdout);
    #endif // ONLINE_JUDGE
    int t ;
    int a,b;
    init();
    scanf("%d",&t);
//    scanf("%d",&n);
    while(t--)
//    while(scanf("%d%d",&n,&m)==2)
    {
        cin>>n;
        printf("%I64d\n",ans[n]);
    }
    return 0;
}