// yukicoder: No.432 占い(Easy)
// 2019.4.17 bal4u

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

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int in()
{
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

int ins(char *s)
{
	char *p = s, c;
	do c = gc(), *s++ = c & 0xf;
	while (c > ' ');
	*--s = 0;
	return s-p;
}

#define MOD 9

char S[1004];
char tbl[1001][1001];

int combi(int n, int k)
{
	int ans;

	if (tbl[n][k] >= 0) return tbl[n][k];
	if ((k << 1) > n) k = n-k;
	if (k == 0) ans = 1;
	else if (k == 1) ans = n % MOD;
	else ans = (combi(n-1, k) + combi(n-1, k-1)) % MOD;
	return tbl[n][k] = ans;
}

int main()
{
	int i, w, s, T;

	memset(tbl, -1, sizeof(tbl));
	T = in();
	while (T--) {
		w = ins(S)-1, s = 0;
		for (i = 0; i <= w; i++) {
			if (S[i] < '9') s += (S[i] & 0xf) * combi(w, i);
		}
		s %= 9;
		if (s == 0) pc('9'); else pc('0'+s);
		pc('\n');
	}
	return 0;
}