#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
ll fac[100005][2], inv[10] = {0, 1, 5, 0, 7, 2, 0, 4, 8, 0};
ll comb(int n, int m){
  ll k = fac[n][1] - fac[m][1] - fac[n-m][1];
  if(k > 1) return 0;
  ll ret = fac[n][0] * inv[fac[m][0]] * inv[fac[n-m][0]];
  if(k > 0) ret *= 3;
  return ret%9;
}

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  fac[0][0] = 1;
  FOR(i, 1, 100005){
    int j = i, c = 0;
    while(j%3==0){
      j /= 3;
      c++;
    }
    fac[i][0] = fac[i-1][0] * j % 9;
    fac[i][1] = fac[i-1][1] + c;
  }
  int t;
  string s;
  cin >> t;
  FOR(i, 0, t){
    cin >> s;
    int l = sz(s), d, ans = 0;
    bool az = true;
    FOR(j, 0, l){
      d = s[j] - '0';
      if(d > 0) az = false;
      ans += comb(l-1, j) * d;
    }
    ans %= 9;
    if(ans == 0 && !az) ans = 9;
    cout << ans << "\n";
  }
  return 0;
}