#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<deque>
#include<functional>
#include<iterator>
#include<set>
#include<utility>
#include<stack>
#include<queue>
#include<bitset>
using namespace std;
#define maxn 300000
#define inf 1500000007
const int mod = 1e9+7;
using namespace std;
long long dp[maxn][5];
int main()
{
    int T,n,i,j,k;
    long long s;
    scanf("%d",&T);
    dp[3][1] = 3;
    dp[3][2] = 3;
    dp[3][3] = 1;
    for(i=4;i<=100000;++i)
    {
        dp[i][1] = i;
        for(j=2;j<=4;++j)
            dp[i][j] = dp[i-1][j] + dp[i-1][j-1]; // 4 2
    }
    while(T--)
    {
        scanf("%d",&n);
        printf("%I64d\n",dp[n][4] + n);
    }
    return 0;
}