#include <stdio.h>
int a[101];
int f[101];
int t;
void dfs(int x);
int main()
{
	int i,j;
	scanf_s("%d", &t);
	for (i = 1; i <= t; i++)
	{
		scanf_s("%d", &a[i]);
	}
	for (i = 1; i <= t; i++) 
	{
		j = a[i];
		dfs(j);
		printf("%d\n", f[a[i]]);
	}
}
void dfs(int x)
{
	if (f[x] > 0)
		return;
	if (x == 1)
	{
		f[x] = 1;
		return;
	}
	dfs(x - 1);
	f[x] = f[x - 1] + x - 1 + x * (x + 1) / 2;

}