func_code_string: #include <bits/stdc++.h>   using namespace std;   int ROW[] = {+1, -1, +0, +0};   int COL[] = {+0, +0, +1, -1};   int X[] = {+0, +0, +1, -1, -1, +1, -1, +1};   int Y[] = {-1, +1, +0, +0, +1, +1, -1, -1};   int KX[] = {-2, -2, -1, -1, 1, 1, 2, 2};   int KY[] = {-1, 1, -2, 2, -2, 2, -1, 1};   int basePrime[] = {1009, 1013, 1019, 1021, 1031, 1223, 1229, 1231, 1237, 1249,                      1289, 1291, 1297, 1301, 1303, 353,  359,  367,  373,  379,                      859,  863,  877,  881,  883,  1931, 1933, 1949, 1951, 1973,                      401,  409,  419,  421,  431,  1709, 1721, 1723, 1733, 1741,                      3499, 3511, 3517, 3527, 3529, 929,  937,  941,  947,  953};   template <class XXX>   XXX GCD(XXX a, XXX b) {     return b == 0 ? a : GCD(b, a % b);   }   template <class XXX>   XXX LCM(XXX a, XXX b) {     return a * (b / GCD(a, b));   }   template <class XXX, class YYY>   bool CMP(XXX a, YYY b) {     return a > b;   }   template <class XXX>   void fastread(XXX &number) {     bool negative = false;     register XXX c;     number = 0;     c = getchar();     if (c ==  - ) {       negative = true;       c = getchar();     }     for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48;     if (negative) number *= -1;   }   void OPFILE() {}   int main() {     OPFILE();     long long int ans[600000];     ans[1] = 0LL;     long long int cnt = 1;     for (int i = 3; i <= 500000; i += 2) {       ans[i] = ans[i - 2] + 8LL * cnt * cnt;       cnt++;     }     int n;     cin >> n;     while (cin >> n) cout << ans[n] << endl;     return 0;   }   