/* Problem URL: https://codeforces.com/contest/2050/problem/C */ #include using namespace std; #define V vector #define rmin(a, b) a = min(a, b) #define rmax(a, b) a = max(a, b) #define rep(i, lim) for (size_t i = 0; i < (lim); i++) #define nrep(i, s, lim) for (size_t i = s; i < (lim); i++) #define repv(i, v) for (auto &i : (v)) #define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; } #define sortv(v) sort(v.begin(), v.end()) #define all(v) (v).begin(), (v).end() using vi = vector; using vvi = vector; using vvvi = vector; using vvvvi = vector; using ll = long long; using vl = vector; using vvl = vector; using vvvl = vector; using vvvvl = vector; template auto operator<<(ostream &os, const vector &vec)->ostream& { os << vec[0]; for (size_t i = 1; i < vec.size(); i++) { os << ' ' << vec[i]; } os << '\n'; return os; } template auto operator>>(istream &is, vector &vec)->istream& { for (auto &i : vec) { is >> i; } return is; } template auto operator<<(ostream &os, const vector> &vec)->ostream& { for (auto &i : vec) { os << i[0]; for (size_t j = 1; j < i.size(); j++) { os << ' ' << i[j]; } os << '\n'; } return os; } template auto operator>>(istream &is, vector> &vec)->istream& { for (auto &i : vec) { for (auto &j : i) { is >> j; } } return is; } bool vis[9]; void pos(int mod, int two, int three) { vis[mod] = true; if (!vis[(mod + 2) % 9] && two > 0) { pos((mod + 2) % 9, two - 1, three); } if (!vis[(mod + 6) % 9] && three > 0) { pos((mod + 6) % 9, two, three - 1); } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { string a; cin >> a; ll total = 0; ll three = 0; ll two = 0; repv(i, a) { total += i - '0'; if (i == '3') { three++; } else if (i == '2') { two++; } } memset(vis, 0, sizeof(vis)); pos(total % 9, two, three); cout << (vis[0] ? "YES\n" : "NO\n"); } }