Read problems statements in Mandarin chinese, Russian and Vietnamese as well. 

Chef is so good at programming that he won almost all competitions. With all the prizes, Chef bought a new house. The house looks like a grid of size N (1-indexed) which consists of N × N rooms containing diamonds. For each room, the room number is equal to the sum of the row number and the column number.
The number of diamonds present in each room is equal to the absolute difference between the sum of even digits and sum of odd digits in its room number. For example, if the room number is 3216, then the number of diamonds present in that room will be |(2+6)-(3+1)| = 4.
You are given the number N. You have to print the total number of diamonds present in Chef's house.

------ Input ------ 

The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
The only line of each test case contains a single integer N.

------ Output ------ 

For each test case, print the answer on a separate line.

------ Constraints ------ 

$1 ≤ T ≤ 10^{5}$
$1 ≤ N ≤ 10^{6}$

------ Subtasks ------ 

Subtask #1 (15 points):

$1 ≤ T ≤ 10$
$1 ≤ N ≤ 1000$

Subtask #2 (15 points):

$1 ≤ T ≤ 10$
$1 ≤ N ≤ 10^{6}$

Subtask #3 (70 points): original constraints

----- Sample Input 1 ------ 
3
1
2
3
----- Sample Output 1 ------ 
2
12
36
----- explanation 1 ------ 
Example case 3: There are 9 rooms. Room (1,1) has number 2, room (1,2) has number 3, etc. For each room, the number of diamonds in it is equal to the room number, so the total number of diamonds present is (2+3+4+3+4+5+4+5+6) = 36.

Difficulty: MEDIUM_HARD

Solutions:
from itertools import repeat

def f(x):
	osum = 0
	esum = 0
	while x > 0:
		d = x % 10
		if d % 2 == 0:
			esum += d
		else:
			osum += d
		x = x // 10
	return abs(osum - esum)
diamonds = list(repeat(0, 1000001))
prefix = list(repeat(0, 2000001))
for i in range(1, len(prefix)):
	prefix[i] = prefix[i - 1] + f(i)
for i in range(1, len(diamonds)):
	diamonds[i] = diamonds[i - 1] + 2 * (prefix[2 * i - 1] - prefix[i]) + f(2 * i)
t = int(input())
for _ in range(t):
	n = int(input())
	print(diamonds[n])


N = 10 ** 6 + 5
dp = [0] * N

def getValue(K):
	(even, odd) = (0, 0)
	while K > 0:
		d = K % 10
		if d & 1 == 1:
			odd += d
		else:
			even += d
		K = K // 10
	return abs(even - odd)

def solve():
	value = [0] * (2 * N)
	for i in range(0, 2 * N):
		value[i] = getValue(i)
	prefix = value[:]
	for i in range(1, 2 * N):
		prefix[i] += prefix[i - 1]
	for i in range(0, N - 1):
		dp[i] = dp[i - 1] + 2 * (prefix[2 * i] - prefix[i]) - value[2 * i]
solve()
T = int(input())
for _ in range(T):
	n = int(input())
	print(dp[n])


def ret_res(ele):
	tot = 0
	while ele > 0:
		if ele & 1 == 1:
			tot -= ele % 10
		else:
			tot += ele % 10
		ele = ele // 10
	return abs(tot)
fun = [0 for _ in range(2 * 10 ** 6 + 1)]
for i in range(2, 2 * 10 ** 6 + 1):
	fun[i] = ret_res(i) + fun[i - 1]
dp = [0 for _ in range(10 ** 6 + 1)]
dp[1] = 2
for i in range(2, 10 ** 6 + 1):
	dp[i] = fun[2 * i] - 2 * fun[i] + fun[2 * i - 1] + dp[i - 1]
for i in range(int(input())):
	n = int(input())
	print(dp[n])


def fun(n):
	s1 = 0
	s2 = 0
	while n > 0:
		if n % 2 == 0:
			s1 += n % 10
		else:
			s2 += n % 10
		n = n // 10
	return abs(s1 - s2)
dp = [0]
k = 1000000
x = [0]
dp1 = [0]
for i in range(2, k * 2 + 1):
	dp.append(fun(i))
	dp1.append(dp1[len(dp1) - 1] + dp[len(dp) - 1])
an = [0, 2, 12]
for i in range(3, k + 1):
	an.append(an[len(an) - 1] + (dp1[(i - 1) * 2 - 1] - dp1[i - 1]) * 2 + dp[i * 2 - 1] + dp[i * 2 - 2] * 2)
t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	print(an[n])


def f(number):
	odd_sum = 0
	even_sum = 0
	while number > 0:
		digit = number % 10
		if digit % 2 == 0:
			even_sum += digit
		else:
			odd_sum += digit
		number = number // 10
	return abs(even_sum - odd_sum)
row = [1]
for i in range(2, 2000001):
	row.append(row[-1] + f(i))
diamonds = [2]
for i in range(1, 1000000):
	diamonds.append(diamonds[i - 1] + 2 * (row[2 * i] - row[i]) + f(2 * i + 2))
for i in range(int(input())):
	print(diamonds[int(input()) - 1])


def fn(n):
	o = e = 0
	while n:
		if n % 10 % 2 == 0:
			e += n % 10
		else:
			o += n % 10
		n //= 10
	return abs(o - e)
d = [0]
for i in range(1, 2000002):
	d.append(fn(i))
pref = [0]
for i in range(1, 2000002):
	pref.append(pref[-1] + d[i])
ans = [2]
for i in range(2, 1000001):
	ans.append(ans[-1] + 2 * (pref[2 * i - 1] - pref[i]) + d[2 * i])
for t in range(int(input())):
	print(ans[int(input()) - 1])


mat = [0] * 1000001
pre = [0] * 2000001

def f(x):
	oddsum = 0
	evensum = 0
	while x:
		digit = x % 10
		if digit % 2 == 0:
			evensum += digit
		else:
			oddsum += digit
		x = x // 10
	return abs(oddsum - evensum)
for i in range(1, len(pre)):
	pre[i] = pre[i - 1] + f(i)
for i in range(1, len(mat)):
	mat[i] = mat[i - 1] + (pre[2 * i - 1] - pre[i]) * 2 + f(2 * i)
for _ in range(int(input())):
	n = int(input())
	print(mat[n])


even = [0] * 2000009
odd = [0] * 2000009
Ar = [0] * 2000009
for i in range(1, 10):
	if i % 2 == 0:
		even[i] = i
	else:
		odd[i] = i
	Ar[i] = Ar[i - 1] + abs(even[i] - odd[i])
for i in range(10, 2000009):
	even[i] = even[i % 10] + even[i // 10]
	odd[i] = odd[i % 10] + odd[i // 10]
	Ar[i] = Ar[i - 1] + abs(even[i] - odd[i])
A = [0] * 1000003
for i in range(1, 1000003):
	A[i] = A[i - 1] + Ar[i * 2] + Ar[2 * i - 1] - 2 * Ar[i]
for _ in range(int(input())):
	print(A[int(input())])


def fun(x):
	esum = 0
	osum = 0
	while x != 0:
		if x % 2 == 0:
			esum += x % 10
		else:
			osum += x % 10
		x = x // 10
	return abs(osum - esum)
Ar = [0] * 2000009
for i in range(1, 2000009):
	Ar[i] = Ar[i - 1] + fun(i)
A = [0] * 1000003
for i in range(1, 1000003):
	A[i] = A[i - 1] + Ar[i * 2] + Ar[2 * i - 1] - 2 * Ar[i]
for _ in range(int(input())):
	print(A[int(input())])


def num(n):
	c1 = 0
	c2 = 0
	while n:
		d = n % 10
		if d % 2 == 0:
			c1 += d
		else:
			c2 += d
		n = n // 10
	return abs(c1 - c2)
l1 = [num(i) for i in range(2 * 10 ** 6 + 2)]
sumarr = [0]
for i in range(1, 2 * 10 ** 6 + 1):
	sumarr.append(sumarr[-1] + l1[i + 1])
ans = [0]
for i in range(1, 10 ** 6 + 1):
	ans.append(ans[-1] + l1[2 * i] + 2 * (sumarr[2 * i - 2] - sumarr[i - 1]))
for i in range(int(input())):
	n = int(input())
	print(ans[n])


import gc
gc.disable()

def main():
	from sys import stdin, stdout
	import atexit, io, sys
	buffer = io.StringIO()
	sys.stdout = buffer

	@atexit.register
	def write():
		sys.__stdout__.write(buffer.getvalue())
	ans = [0] * 1000001
	ans[1] = 2
	llSum = 2
	ress = [0] * 2 * 1000001
	for y in range(10):
		ress[y] = y if y % 2 else -y
	for y in range(10, 2 * 1000001):
		ress[y] = ress[y % 10] + ress[y // 10]
	for x in range(2, 1000001):
		llSum = llSum - abs(ress[x]) + abs(ress[x * 2 - 1]) + abs(ress[x * 2])
		ans[x] = ans[x - 1] + llSum * 2 - abs(ress[x * 2])
	t = int(stdin.readline())
	stdout.write('\n'.join((str(ans[int(n)]) for n in stdin.readlines())))
main()


N = 1000000

def diam(i):
	res = 0
	x = i
	while True:
		y = x % 10
		if y % 2 == 0:
			res += y
		else:
			res -= y
		x //= 10
		if x == 0:
			break
	return abs(res)
dia = list(map(diam, range(2 * N + 1)))
diamond = list(range(N + 1))
diamond[1] = (2, 0)
diamond[2] = (12, 10)
for i in range(3, N + 1):
	x = diamond[i - 1][1] - 2 * dia[i] + dia[2 * i - 2] + 2 * dia[2 * i - 1] + dia[2 * i]
	diamond[i] = (diamond[i - 1][0] + x, x)
t = int(input())
for _ in range(t):
	n = int(input())
	print(diamond[n][0])


oddarr = [0] * 2000219
evenarr = [0] * 2000219
diff = [0] * 2000219
sudiff = [0] * 2000219
oddarr[0] = 0
evenarr[0] = 1
for i in range(1, 10, 1):
	oddnow = 0
	evennow = 0
	if i % 2 == 0:
		evennow = i
	else:
		oddnow = i
	oddarr[i] = oddnow
	evenarr[i] = evennow
	diff[i] = abs(oddarr[i] - evenarr[i])
for i in range(10, 2000219):
	ele = i % 10
	oddnow = oddarr[i // 10]
	evennow = evenarr[i // 10]
	if ele % 2 == 0:
		evennow += ele
	else:
		oddnow += ele
	oddarr[i] = oddnow
	evenarr[i] = evennow
	diff[i] = abs(oddarr[i] - evenarr[i])
sudiff[0] = 0
sudiff[1] = 2
for i in range(2, 2000219):
	sudiff[i] = sudiff[i - 1] + diff[i]
ansarr = [0] * 2000219
ansarr[0] = 0
ansarr[1] = 2
for i in range(2, 1000109):
	ansarr[i] = ansarr[i - 1] + 2 * (sudiff[2 * i] - sudiff[i]) - diff[2 * i]
for _ in range(int(input())):
	n = int(input())
	print(ansarr[n])


list1 = []
for _ in range(int(input())):
	M = int(input())
	list1.append(M)
mentos = max(list1)
array = [0, 0]
array1 = [0, 0]
for i in range(2, 2 * mentos + 1):
	answer = i
	array4 = 0
	array5 = 0
	while answer:
		values = answer % 10
		answer = answer // 10
		if values % 2 == 0:
			array4 += values
		else:
			array5 += values
	addition = int(abs(array4 - array5))
	array.append(addition)
	array1.append(array1[-1] + addition)
array2 = [0, 2]
for i in range(2, mentos + 1):
	array2.append((array1[2 * i - 1] - array1[i]) * 2 + array[2 * i] + array2[-1])
for M in list1:
	print(array2[M])


arr = []
for _ in range(int(input())):
	N = int(input())
	arr.append(N)
mint = max(arr)
hello = [0, 0]
hello1 = [0, 0]
for i in range(2, 2 * mint + 1):
	number = i
	hello4 = 0
	hello5 = 0
	while number:
		digit = number % 10
		number = number // 10
		if digit % 2 == 0:
			hello4 += digit
		else:
			hello5 += digit
	differ = int(abs(hello4 - hello5))
	hello.append(differ)
	hello1.append(hello1[-1] + differ)
hello2 = [0, 2]
for i in range(2, mint + 1):
	hello2.append((hello1[2 * i - 1] - hello1[i]) * 2 + hello[2 * i] + hello2[-1])
for N in arr:
	print(hello2[N])


import sys
sys.setrecursionlimit = 2000001

def number_of_diamonds(room_number):
	(even_sum, odd_sum) = (0, 0)
	while room_number:
		digit = room_number % 10
		if digit % 2:
			even_sum += digit
		else:
			odd_sum += digit
		room_number //= 10
	return abs(even_sum - odd_sum)
assert number_of_diamonds(room_number=3316) == 1
assert number_of_diamonds(room_number=0) == 0
assert number_of_diamonds(room_number=10) == 1
DIAMONDS = [number_of_diamonds(room_number=room_number) for room_number in range(2000001)]
prefixSum = [0] * 2000001
for i in range(1, 2000001):
	prefixSum[i] = prefixSum[i - 1] + DIAMONDS[i]
assert prefixSum[4] == 10
cache = {}
cache[1] = 2
cache[2] = 12

def total_diamonds(num):
	if num in cache:
		return cache[num]
	else:
		cache[num] = 2 * (prefixSum[2 * num - 1] - prefixSum[num]) + DIAMONDS[2 * num] + total_diamonds(num=num - 1)
	return cache[num]
for i in range(1, 1000001):
	total_diamonds(num=i)
T = int(input().strip())
for _ in range(T):
	N = int(input().strip())
	print(total_diamonds(num=N))


ans = [0] * 2000005
anr = [0] * 2000005
A = [0] * 1000005
for i in range(10):
	if i % 2 == 0:
		ans[i] = ans[i] + i
	else:
		ans[i] = ans[i] - i
anr[0] = 0
for i in range(10, 2000005):
	n = i
	d = n % 10
	f = n // 10
	if d % 2 == 0:
		ans[n] = ans[f] + d
	else:
		ans[n] = ans[f] - d
for i in range(0, 2000005):
	if ans[i] < 0:
		ans[i] = ans[i] * -1
for i in range(1, 2000005):
	anr[i] = anr[i - 1] + ans[i]
A[0] = 0
A[1] = ans[2]
for i in range(2, 1000002):
	A[i] = A[i - 1]
	A[i] = A[i] + 2 * (anr[2 * i - 1] - anr[i])
	A[i] = A[i] + ans[2 * i]
for _ in range(int(input())):
	n = int(input())
	print(A[n])


t = int(input().strip())

def findDiamonds(num):
	even = 0
	odd = 0
	while num > 0:
		rem = num % 10
		if rem % 2 == 0:
			even += rem
		else:
			odd += rem
		num //= 10
	return abs(even - odd)
precomputed = [0 for i in range(10 ** 6 + 20)]
prev_row = [0 for i in range(2 * 10 ** 6 + 20)]
prev_row[0] = 2
prev_row_count = 2
first = 0
last = 0
precomputed[1] = 2
for i in range(2, 1000001):
	prev_row_count -= prev_row[first]
	first += 1
	last += 1
	prev_row[last] = findDiamonds(2 * i - 1)
	last += 1
	prev_row[last] = findDiamonds(2 * i)
	prev_row_count += prev_row[last] + prev_row[last - 1]
	precomputed[i] = precomputed[i - 1] + 2 * prev_row_count - prev_row[last]
for i in range(t):
	n = int(input().strip())
	print(precomputed[n])


def digDiff(n):
	odd = 0
	even = 0
	while n > 0:
		dig = n % 10
		if dig & 1 == 0:
			even += dig
		else:
			odd += dig
		n = n // 10
	return abs(even - odd)
dia = [digDiff(i) for i in range(2 * 10 ** 6 + 1)]
dp = [0] * (10 ** 6 + 1)
dp[1] = 2
res = dp[1]
for i in range(2, len(dp)):
	res = res - dia[i] + dia[2 * i - 1] + dia[2 * i]
	dp[i] = dp[i - 1] + 2 * res - dia[2 * i]
for _ in range(int(input())):
	print(dp[int(input())])


def s(k):
	even = 0
	odd = 0
	if k == 0:
		return 0
	while k != 0:
		if k % 10 % 2 == 0:
			even = even + k % 10
		elif k % 10 % 2 == 1:
			odd = odd + k % 10
		k = k // 10
	return abs(odd - even)
a = [0] * (2 * 10 ** 6 + 1)
for i in range(2, 2 * 10 ** 6 + 1):
	if i <= 9:
		a[i] = i
	else:
		a[i] = s(i)
b = [0] * (10 ** 6 + 1)
for j in range(1, 10 ** 6 + 1):
	if i <= 4:
		b[i] = i * i * (i + 1)
	else:
		b[j] = b[j - 1] + b[j - 1] - b[j - 2] - 2 * a[j] + a[2 * j - 2] + 2 * a[2 * j - 1] + a[2 * j]
t = int(input())
for _ in range(t):
	n = int(input())
	print(b[n])


import math
t = int(input().strip())
k = 10 ** 6 + 1
f = [0] * 2 * k
for i in range(10):
	f[i] = i if i % 2 else -i
for i in range(10, 2 * k):
	f[i] = f[i // 10] + f[i % 10]
m = [0] * k
m[1] = 2
m[2] = 12
d = [0] * k
d[2] = 3
for i in range(3, k):
	i2 = i * 2
	d[i] = d[i - 1] - abs(f[i]) + abs(f[i2 - 1]) + abs(f[i2 - 2])
	m[i] = m[i - 1] + 2 * d[i] + abs(f[i2])
for i in range(t):
	n = int(input().strip())
	print(m[n])


from datetime import datetime
x1 = []
x1.append(0)
x3 = []
x3.append(0)
x4 = []
x2 = []
m = 0
sum1 = 0
sum2 = 0
sum4 = 0
for i in range(1, 2000001):
	x = 1 + i
	y = 1000000 + i
	if x % 10 == 0:
		while x % 10 == 0:
			sum1 -= 9
			x = x // 10
		x = x % 10
		sum1 += -(-1) ** (x - 1) * -(x - 1) + (-1) ** x * -x
		m = 0
	else:
		x = x % 10
		sum1 += -m + (-1) ** x * -x
		m = (-1) ** x * -x
	sum2 += abs(sum1)
	x1.append(abs(sum1))
	x3.append(sum2)
x1[-1] = 2
x5 = []
x5.append(0)
z = 0
for i in range(0, 1000000):
	a = (x3[2 * i + 1] - x3[i]) * 2 - x1[2 * i + 1]
	x5.append(a + z)
	z += a
t = int(input())
for i in range(t):
	n = int(input())
	print(x5[n])


l = []
c = []
l.append(0)
l.append(-1)
k = 4
pu = 0
s = 0
c.append(0)
c.append(2)
c.append(12)
c.append(36)
for i in range(2, 2 * 1000000 + 1):
	f = 0
	if i < 10:
		if i % 2 == 0:
			l.append(i)
		else:
			l.append(-i)
	else:
		pi = i // 10
		if i % 2 == 0:
			ele = l[pi] + i % 10
		else:
			ele = l[pi] - i % 10
		l.append(ele)
	if i % 2 == 0 and i >= 8:
		c.append(c[i // 2 - 1] + 2 * s + abs(l[i]))
		f = 1
		if i == 8:
			pu = 5
	if i > 4:
		s += abs(l[i])
		if f == 1:
			s = s - abs(l[pu])
			pu = pu + 1
			f = 0
for i in range(int(input())):
	p = int(input())
	print(c[p])


t = int(input())
room_list = []
inp = []
for i in range(t):
	n = int(input())
	inp.append(n)
max_inp = max(inp) + 1
max_rno = 2 * max_inp + 1
for room_no in range(max_rno):
	even = 0
	odd = 0
	while room_no > 0:
		l = room_no % 10
		if l % 2 == 0:
			even += l
		else:
			odd += l
		room_no //= 10
	diamond_count = abs(odd - even)
	room_list.append(diamond_count)
dim_list = [0, 2, 12]
a = 3
for dim in range(3, max_inp):
	stop = dim * 2
	a -= room_list[dim]
	a += room_list[2 * (dim - 1)]
	a += room_list[2 * dim - 1]
	b = a * 2
	b += room_list[stop]
	b += dim_list[-1]
	dim_list.append(b)
for i in range(t):
	print(dim_list[inp[i]])


def dig_diff(n):
	s1 = 0
	s2 = 0
	while n > 0:
		if n % 10 % 2 == 0:
			s1 += n % 10
		else:
			s2 += n % 10
		n //= 10
	return abs(s1 - s2)
lis_dice = [0]
for i in range(1, 2000001):
	lis_dice.append(dig_diff(i) + lis_dice[i - 1])
vals = [0]
for i in range(1, 1000001):
	temp = vals[i - 1]
	temp += lis_dice[i + i] + lis_dice[i + i - 1] - 2 * lis_dice[i]
	vals.append(temp)
n = int(input())
for i in range(n):
	inp = int(input())
	print(vals[inp])


def eval(n):
	ret = 0
	while n:
		no = n % 10
		ret = ret - no if no % 2 else ret + no
		n //= 10
	return abs(ret)
prsum = [0, 0]
for no in range(2, 2000001):
	prsum.append(prsum[-1] + eval(no))
ans = [0, 2]
for no in range(2, 1000001):
	ans.append(ans[-1] + 2 * (prsum[2 * no] - prsum[no]) - eval(2 * no))
for _ in range(int(input().strip())):
	N = int(input().strip())
	print(ans[N])


def diamond(k):
	even = odd = 0
	while k > 0:
		x = k % 10
		k //= 10
		if x % 2 == 0:
			even += x
		else:
			odd += x
	return abs(even - odd)
l = [0, 0]
for j in range(2, 2000001):
	l.append(diamond(j))
t = [0, 2, 12]
sum1 = l[3]
for j in range(3, 1000001):
	sum2 = t[j - 1]
	p = 2 * j
	sum1 += l[p - 1] + l[p - 2] - l[j]
	sum2 += 2 * sum1
	sum2 += l[2 * j]
	t.append(sum2)
x = int(input())
for k in range(x):
	n = int(input())
	print(t[n])


T = int(input().strip())
(ans, TD) = ([(0, 0, 0, 0)], [0, 2])
for i in range(1, 10):
	even = 0 if i & 1 else i
	odd = 0 if even else i
	ans.append((even, odd, i, i + ans[i - 1][3]))
for i in range(10, 2 * 1000000 + 2):
	(j, k) = divmod(i, 10)
	even = ans[j][0] + ans[k][0]
	odd = ans[j][1] + ans[k][1]
	diff = abs(even - odd)
	ans.append((even, odd, diff, diff + ans[i - 1][3]))
for i in range(2, 1000001):
	TD.append(TD[i - 1] + ans[2 * i][2] + 2 * (ans[2 * i - 1][3] - ans[i][3]))
for _ in range(T):
	print(TD[int(input().strip())])


from math import *

def calc(n):
	(tmp, i, p) = (n, 0, 0)
	while tmp > 0:
		C = tmp % 10
		tmp //= 10
		if C % 2 == 0:
			p += C
		else:
			i += C
	return int(fabs(i - p))
f = [0, 1]
pref_sum = [0, 1]
dimond = [0, 2]
for i in range(2, 2000003):
	f.append(calc(i))
	pref_sum.append(pref_sum[i - 1] + f[i])
for i in range(2, 1000002):
	dimond.append(dimond[i - 1] + 2 * (pref_sum[2 * i] - pref_sum[i]) - f[2 * i])
T = int(input())
for _ in range(T):
	print(dimond[int(input())])


L = []
for _ in range(int(input())):
	N = int(input())
	L.append(N)
MAX_N = max(L)
Table = [0, 0]
CumTable = [0, 0]
for i in range(2, 2 * MAX_N + 1):
	num = i
	even_sum = 0
	odd_sum = 0
	while num:
		digit = num % 10
		num = num // 10
		if digit % 2 == 0:
			even_sum += digit
		else:
			odd_sum += digit
	diff = int(abs(even_sum - odd_sum))
	Table.append(diff)
	CumTable.append(CumTable[-1] + diff)
AnsTable = [0, 2]
for i in range(2, MAX_N + 1):
	AnsTable.append((CumTable[2 * i - 1] - CumTable[i]) * 2 + Table[2 * i] + AnsTable[-1])
for N in L:
	print(AnsTable[N])


def foo(n):
	(e, o) = (0, 0)
	while n > 0:
		r = n % 10
		n = n // 10
		if r & 1:
			o += r
		else:
			e += r
	return abs(e - o)
N = 2000010
n = 1000002
A = [foo(i) for i in range(N)]
S = [0] * N
for i in range(1, N):
	S[i] = S[i - 1] + A[i]
ans = [0] * n
ans[0] = 2
for i in range(1, n):
	ans[i] = ans[i - 1] + 2 * (S[2 + i + i - 1] - S[2 + i - 1]) + S[2 * (i + 1)] - S[2 * (i + 1) - 1]
T = int(input().strip())
for _ in range(T):
	n = int(input().strip())
	print(ans[n - 1])


from itertools import accumulate
N = 2000001

def f(n):
	ans = 0
	while n:
		r = n % 10
		if r & 1:
			ans += r
		else:
			ans -= r
		n //= 10
	return abs(ans)
g = ((x, i * x) for (i, x) in enumerate(map(f, range(1, N))))
l = list(accumulate(g, lambda x, y: (x[0] + y[0], x[1] + y[1])))
t = int(input())
for _ in range(t):
	n = int(input())
	(l1, l2) = (l[n], l[2 * n - 1])
	print(2 * (l1[1] + n * (l2[0] - l1[0])) - l2[1])


def op(x):
	o = 0
	e = 0
	while x > 0:
		if x % 2:
			o += x % 10
		else:
			e += x % 10
		x //= 10
	return abs(o - e)
N = 1000000
d = [0] * (2 * N + 1)
for i in range(1, 2 * N + 1):
	d[i] = op(i) + d[i - 1]
a = [0] * (N + 1)
a[1] = 2
for i in range(2, N + 1):
	a[i] += a[i - 1] + d[2 * i - 1] + d[2 * i] - 2 * d[i]
t = int(input())
for k in range(t):
	print(a[int(input())])


def diamondsInRoom(n):
	(totalOdds, totalEvens) = (0, 0)
	while n != 0:
		if n % 2 == 0:
			totalEvens += n % 10
		else:
			totalOdds += n % 10
		n //= 10
	return abs(totalOdds - totalEvens)
answers = ['*']
roomNumberValues = [diamondsInRoom(n) for n in range(0, 2 * 10 ** 6 + 1)]
totalDiamonds = 0
diamondsThisEdge_last = 0
for N in range(1, 10 ** 6):
	diamondsThisEdge = diamondsThisEdge_last
	diamondsThisEdge -= roomNumberValues[N]
	diamondsThisEdge += roomNumberValues[2 * N - 1]
	diamondsThisEdge += roomNumberValues[2 * N]
	totalDiamonds += 2 * diamondsThisEdge - roomNumberValues[2 * N]
	answers.append(totalDiamonds)
	diamondsThisEdge_last = diamondsThisEdge
T = int(input())
for _ in range(T):
	N = int(input())
	print(answers[N])


def diamonds(n):
	odd = even = 0
	while n > 0:
		if n % 2 == 0:
			even += n % 10
		else:
			odd += n % 10
		n //= 10
	return abs(odd - even)
N = 1000000
t = int(input())
rooms = [0 for i in range(2 * N + 1)]
dp = [0 for i in range(N + 1)]
for i in range(1, 2 * N + 1):
	rooms[i] = rooms[i - 1] + diamonds(i)
for i in range(1, N + 1):
	dp[i] = dp[i - 1] + 2 * (rooms[2 * i] - rooms[i]) - (rooms[2 * i] - rooms[2 * i - 1])
for caseNr in range(t):
	n = int(input())
	print(dp[n])


T = int(input())
d = [-1] * (2 * 10 ** 6 + 1)
D = [-1] * (2 * 10 ** 6 + 1)
_N = [-1] * (10 ** 6 + 1)
_N[1] = 2
_N[2] = 12
d[0] = 0
d[1] = -1
d[2] = 2
d[3] = -3
d[4] = 4
d[5] = -5
d[6] = 6
d[7] = -7
d[8] = 8
d[9] = -9
D[1] = 0
D[2] = 2
D[3] = 5
D[4] = 9
D[5] = 14
D[6] = 20
D[7] = 27
D[8] = 35
D[9] = 44

def diamond(n):
	lastdigit = n % 10
	if lastdigit % 2 == 0:
		d[n] = d[n // 10] + lastdigit
	else:
		d[n] = d[n // 10] - lastdigit
	D[n] = D[n - 1] + abs(d[n])
for k in range(10, 2 * 10 ** 6):
	diamond(k)
for k in range(3, 10 ** 6 + 1):
	_N[k] = _N[k - 1] + 2 * (D[2 * k] - D[k]) - abs(d[2 * k])
for t in range(0, T):
	N = int(input())
	print(_N[N])


NMAX = 10 ** 6

def val(n):
	S = [0, 0]
	while n:
		d = n % 10
		S[d % 2] += d
		n //= 10
	return abs(S[0] - S[1])

def main():
	R = [0]
	P = [0]
	S = [0]
	for i in range(1, NMAX + 1):
		R.append(val(2 * i - 1))
		P.append(P[-1] + R[-1])
		R.append(val(2 * i))
		P.append(P[-1] + R[-1])
		S.append(S[-1] + R[-1] + 2 * (P[-2] - P[-1 - i]))
	T = int(input())
	for _ in range(T):
		N = int(input())
		print(S[N])
main()


import sys
e = [0 if i % 2 else i for i in range(10)]
o = [i if i % 2 else 0 for i in range(10)]
d = [abs(e[i] - o[i]) for i in range(10)]
ex = [0, 2, 10]
ans = [0, 2, 12]

def prec():
	for i in range(10, 2000001):
		e.append(e[int(i / 10)] + e[i % 10])
		o.append(o[int(i / 10)] + o[i % 10])
		d.append(abs(e[i] - o[i]))
	for n in range(3, 1000001):
		ext = ex[n - 1] - 2 * d[n] + d[2 * (n - 1)] + 2 * d[2 * n - 1] + d[2 * n]
		ex.append(ext)
		ans.append(ans[n - 1] + ext)
prec()

def calc(n):
	ans = 0
	for i in range(2, 2 * n + 1):
		if i > n + 1:
			m = 2 * n - i + 1
		else:
			m = i - 1
		ans += m * d[i]
	return ans
t = int(input().strip())
for i in range(t):
	n = int(input().strip())
	print(ans[n])


import numpy as np

def diamonds(k):
	ret = np.zeros(k, dtype=np.int64)
	idx = np.arange(k, dtype=np.int64)
	vals = np.array([j if j & 1 else -j for j in range(10)])
	t = 1
	while t < k:
		i0 = idx // t % 10
		ret += vals[i0]
		t *= 10
	return np.abs(ret)
DD = diamonds(10 ** 6 * 2 + 100)[2:]
D0 = np.cumsum(DD)
D1 = np.cumsum(D0)

def solve(n):
	if n == 1:
		return 2
	n -= 1
	ret = D1[2 * n] - 2 * D1[n - 1]
	return ret
import sys
f = sys.stdin
t = int(f.readline())
for i in range(t):
	n = int(f.readline())
	print(solve(n))


def count(n):
	(c0, c1) = (0, 0)
	while n > 0:
		if n % 2 == 0:
			c0 += n % 10
		else:
			c1 += n % 10
		n //= 10
	return abs(c0 - c1)
N = 1000000
cc = [count(n) for n in range(N + N + 1)]
ss = [0 for n in range(N + N + 1)]
for n in range(1, N + N + 1):
	ss[n] = ss[n - 1] + cc[n]
dd = [0 for n in range(N + 1)]
for n in range(1, N + 1):
	dd[n] = dd[n - 1] + (ss[n + n] - ss[n]) * 2 - cc[n + n]
print(*(dd[int(input())] for _ in range(int(input()))), sep='\n')


from sys import stdin
from bisect import bisect_left, bisect_right
input = stdin.readline
MAX = int(1000000.0) + 1
val = [0] * (MAX << 1)
ans = [0] * MAX

def digit_sum(num):
	(e, o) = (0, 0)
	while num:
		(d, num) = (num % 10, num // 10)
		(e, o) = (e, o + d) if d % 2 else (e + d, o)
	return abs(e - o)
for i in range(1, MAX << 1):
	val[i] = val[i - 1] + digit_sum(i)
for i in range(1, MAX):
	ans[i] = ans[i - 1] + val[i << 1] + val[i - 1 << 1 | 1] - (val[i] << 1)
t = int(input().strip())
while t:
	n = int(input().strip())
	print(ans[n])
	t -= 1