#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define nl "\n"
#define sz(x) int(x.size())
#define NumOfDigit(w) log10(w) + 1
#define fill(arr, val)  memset(arr, val , sizeof(arr))
#define PI 3.141592654
#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define fi first
#define se second
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define fixed(n) fixed << setprecision(n)
//#define MOD  1e9 + 7


void IO(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
}
void files(){
    //freopen("filename.in" , "r" ,stdin);
            #ifndef ONLINE_JUDGE
              freopen("input.txt", "r", stdin);  freopen("output.txt", "w", stdout);
            #endif
}

ll sum (ll n ){
    return  n * (n+1) /2;
}

double ncr(double n, double r){
    if (n < r) return 0;
    if (r == 0 || n == r) return 1;
    return ( n / r )* ncr(n -1, r - 1);
}
void solve(){

ll n ;
cin >> n ;
ll ans = 2 * n -1 + 2 * ( sum (2*n-2 ) - sum(n-1 )) ;

cout << fixed(0)<< ans + n -1 + ncr(n , 3) * 6   << nl;


}
int main(){
                 IO();       //  files();

    int testCase=1;  // one test case
        cin >> testCase ;
 while(testCase--)
        solve();  // my code

    return 0;
}