#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#include <array>
#include <chrono>
#include <random>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { std::cin >> first; Scan(rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define PAIR std::pair<int, int>
#define PAIRLL std::pair<ll, ll>
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\t";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& i : v){std::cerr << i << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& i : v){for(const auto& j : i){std::cerr << j << " ";}std::cerr << "\n";}}
#define SHOWPAIRVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& i : v){for(const auto& j : i){std::cerr<<'('<<j.first<<", "<<j.second<<") ";}std::cerr << "\n";}}
#define SHOWPAIRVECTOR(v) {for(const auto& i:v){std::cerr<<'('<<i.first<<", "<<i.second<<") ";}std::cout<<"\n";}
#define CHECKTIME(state) {auto start=std::chrono::system_clock::now();state();auto end=std::chrono::system_clock::now();auto res=std::chrono::duration_cast<std::chrono::nanoseconds>(end-start).count();std::cerr<<"[Time:"<<res<<"ns  ("<<res/(1.0e9)<<"s)]\n";}
#define SHOWQUEUE(a) {std::queue<decltype(a.front())> tmp(a);std::cerr << #a << "\t:";for(int i=0; i<static_cast<int>(a.size()); ++i){std::cerr << tmp.front() << "\n";tmp.pop();}std::cerr << "\n";}
#define CHMAX(a, b) a = (((a)<(b)) ? (b) : (a))
#define CHMIN(a, b) a = (((a)>(b)) ? (b) : (a))
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}

#define int ll
using ll = long long;
using ull = unsigned long long;
constexpr int INFINT = 1 << 30;              // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;  // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;              // 1.15x10^18
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238;

long C(long n, long r, int p, int q, std::vector<int>& fact, std::vector<int>& ifact) {
	if (n < 0 || r < 0 || r > n)return 0;
	int P = 1;
	for (int i = 0; i < q; i++)P *= p;

	long z = n - r;
	int e0 = 0;
	for (long u = n / p; u > 0; u /= p)e0 += u;
	for (long u = r / p; u > 0; u /= p)e0 -= u;
	for (long u = z / p; u > 0; u /= p)e0 -= u;

	int em = 0;
	for (long u = n / P; u > 0; u /= p)em += u;
	for (long u = r / P; u > 0; u /= p)em -= u;
	for (long u = z / P; u > 0; u /= p)em -= u;

	long ret = 1;
	while (n > 0) {
		ret = ret * fact[(int)(n%P)] % P * ifact[(int)(r%P)] % P * ifact[(int)(z%P)] % P;
		n /= p; r /= p; z /= p;
	}
	for (int i = 0; i < e0; i++)ret = ret * p % P;
	if (!(p == 2 && q >= 3) && (em & 1) == 1)ret = (P - ret) % P;
	return ret;
}

void makeFF(int p, int q, std::vector<int>& fact, std::vector<int>& ifact) {
	int P = 1;
	for (int i = 0; i < q; i++)P *= p;
	fact.resize(P + 1, 0);
	ifact.resize(P + 1, 0);
	fact[0] = 1;
	for (int i = 1; i <= P; i++) {
		if (i % p == 0) {
			fact[i] = fact[i - 1];
		}
		else {
			fact[i] = fact[i - 1] * i % P;
		}
	}
	for (int i = 0; i <= P; i++) {
		long ret = 1;
		long mul = fact[i];
		for (long n = P / p*(p - 1) - 1; n > 0; n >>= 1) {
			if ((n & 1) == 1) {
				ret = (ret * mul) % P;
			}
			mul = (mul * mul) % P;
		}
		ifact[i] = (int)ret;
	}
}

ll fix(ll& n) {
	return n = (n + 8) % 9 + 1;
}

signed main() {
	INIT;
	VAR(int, Q);
	std::vector<int> fa, ifa;
	makeFF(3, 2, fa, ifa);
	REP(q, Q) {
		VAR(std::string, s);
		if (s.size() == 1 && s[0] == '0') {
			OUT(0)BR;
			continue;
		}
		int n = s.size();
		ll ans = 0;
		REP(i, n) {
			ans += C(n - 1, i, 3, 2, fa, ifa) * (s[i] - '0');
			fix(ans);
		}
		OUT(ans)BR;
	}
	return 0;
}