#include <assert.h>
#include <stdio.h>
#include <string.h>

#define NMAX 1000001

int val[2 * NMAX];
long long sval[2 * NMAX], g[NMAX];

void Precompute() {
	sval[0] = val[0] = 0;
	for (int i = 1; i < 2 * NMAX; ++i) {
		int x = i;
		while (x > 0) {
			const int d = x % 10;
			if (d & 1) val[i] += d;
			else val[i] -= d;
			x /= 10;
		}
		if (val[i] < 0) val[i] = -val[i];
		sval[i] = sval[i - 1] + val[i];
	}
	g[1] = val[2];
	for (int i = 2; i < NMAX; ++i)
		g[i] = g[i - 1] + 2LL * (sval[2 * i - 1] - sval[i]) + val[2 * i];
}

int main() {
	Precompute();
	int T;
	scanf("%d", &T);
	while (T--) {
		int N;
		scanf("%d", &N);
		assert(1 <= N && N < NMAX);
		printf("%lld\n", g[N]);
	}
	return 0;
}