// yukicoder: No.432 占い(Easy) // 2019.4.17 bal4u #include #include #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; do *s = gc(); while (*s++ > ' '); *--s = 0; return s - p; } #define MOD 9 char S[100003], *p; int tbl[100003][2]; int id = -1; char t[100003]; int inv[10] = {0,1,5,0,7,2,0,4,8,0}; int p3(int *a, int n) { int r = 0; while (n % 3 == 0) r++, n /= 3; *a = n; return r; } void calcBC(int n) { int i, a, b; tbl[0][0] = 1, tbl[0][1] = 0, t[0] = 1; if (n == 0) return; tbl[1][1] = p3(&a, n), tbl[1][0] = a % MOD, t[1] = n % MOD; for (i = 2; i <= n; i++) { tbl[i][1] = tbl[i-1][1] + p3(&a, n+1-i) - p3(&b, i); tbl[i][0] = (tbl[i-1][0] * a * inv[(b % MOD)]) % MOD; if (tbl[i][1] >= 2) t[i] = 0; else if (tbl[i][1] == 0) t[i] = tbl[i][0] % MOD; else t[i] = tbl[i][0]*3 % MOD; } } int main() { int i, w, s, T; T = in(); while (T--) { w = ins(p = S)-1; while (*p == '0') p++; if (*p == 0) s = 0; else { if (id != w) calcBC(w), id = w; s = 0; for (i = 0; i <= w; i++) { if (S[i] < '9') s += (S[i] & 0xf) * t[i]; } s %= 9; if (s == 0) s = 9; } pc('0'+s), pc('\n'); } return 0; }