#include<bits/stdc++.h>
using namespace std;
typedef long long LL;

const int N = 1010;
int n;
LL ans;
LL s[N]; //前缀和

void s_init() //预处理前缀和
{
	for(int i = 1; i <= 1000; i ++)
		s[i] += (s[i - 1] + (2 * i - 1));
}

int main()
{
	s_init();
	
	cin >> n;
	
	while(n --)
	{
		LL x, ans = 1;
		cin >> x;
		
		if(x != 0) ans = s[x] + s[x - 1]; //上半(含分割线)+下半(不含分割线)
		
		cout << ans << endl;
	}
	return 0;
}