#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<map>
#include<iostream>
#include<vector>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<ctime>
#include<cctype>
#include<set>
#include<algorithm>
using namespace std;
const int INF=1e9+7;
typedef pair<int,int> pii;
typedef long long ll;
ll a[100010];
int main(){
//    freopen("D://input.txt","r",stdin);
    a[0]=0;
    a[1]=1;
    a[2]=2;
    a[3]=3;
    for(ll i=4;i<=100000;i++){
        a[i]=a[i-1]+1;
        a[i]+=i*(i-2)*(i-3)/2;
        a[i]+=i-3;
        a[i]-=(i-2)*(i-2+1)*(2*(i-2)+1)/6;
        a[i]+=1;
    }
    int T;scanf("%d",&T);
    while(T--){
        int n;scanf("%d",&n);
        printf("%I64d\n",a[n]);
    }
//  printf("%.3f\n",(double)clock()/CLOCKS_PER_SEC);
    return 0;
}