25~~

int T;
scanf("%d", &T);
while (T--)
{
int n;
scanf("%d", &n);
int mid = (n + 1) / 2; // 中间行（行号从1开始）
long long sum = 0;
for (int i = 1; i <= n; ++i)
{ // 每行i从1到n
int d = abs(i - mid); // 当前行到中间行的距离
int m = n - 2 * d; // 当前行的元素个数
long long start = (long long)(i - 1) * n + 1 + d;
long long end = (long long)i * n - d;
sum += (long long)m * (start + end) / 2;
}

printf("%lld\n", sum);
}
return 0;