import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


enum LIM = 10^^5 + 10;

void main() {
  auto facD = new int[LIM];
  auto facE = new int[LIM];
  facD[0] = 1;
  facE[0] = 0;
  foreach (i; 1 .. LIM) {
    int d = i, e = 0;
    for (; d % 3 == 0; d /= 3, ++e) {}
    facD[i] = (facD[i - 1] * d) % 9;
    facE[i] = facE[i - 1] + e;
  }
  debug {
    writeln(facD[0 .. 28]);
    writeln(facE[0 .. 28]);
  }
  
  int binom(int n, int k) {
    enum modInv = [0, 1, 5, 0, 7, 2, 0, 4, 8];
    const d = (facD[n] * modInv[facD[k]] * modInv[facD[n - k]]) % 9;
    const e = facE[n] - facE[k] - facE[n - k];
    return (e == 0) ? d : (e == 1) ? ((d * 3) % 9) : 0;
  }
  
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        const S = readToken();
        const N = cast(int)(S.length) - 1;
        int ans;
        if (S.all!"a == '0'") {
          ans = 0;
        } else {
          foreach (i; 0 .. N + 1) {
            (ans += binom(N, i) * (S[i] - '0')) %= 9;
          }
          if (ans == 0) {
            ans = 9;
          }
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}