#include <iostream>
#include<algorithm>
#include<iomanip>
#include<string.h>
#include<unordered_map>
#include<map>
#include<cmath>
#include<vector>
#include<iomanip>
#include<queue>
using namespace std;
#define inf 1000000007
#define MOD 1000000007
#define x first
#define y second
#define ll long long
#define ii pair<ll, ll>
#define vi vector<ll>
#define vii vector<ii>
#define pb push_back
#include<set>
#define mp make_pair
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, ll p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
inline ll mult(ll a, ll b, ll p = MOD) {return (ll) a * b % p;}
inline ll inv(ll a, ll p = MOD) {return fpow(a, p - 2, p);}
ll n, k, flag=0;
bool prime[1000001];
vi primes;
void sieve()
{
    ll i, j;
    for(i=2; i<=1000000; i++){
        if(prime[i]==0){
            for(j=i+i; j<=1000000; j+=i)
                prime[i]= 1;
            primes.pb(i);
        }
    }
}
int main() {
  //  ios
    ll a, b, c=0, i, j;
    ll ans=0;
    ll t;
    cin>>t;
    while(t--){
        ll ans=0;
        cin>>n;
        for(i=0; i<n; i++){
            cin>>a;
            while(a>0){
                ans+= a%10;
                a/= 10;
            }
        }
        if(ans%3==0) cout<<"Yes\n";
        else cout<<"No\n";
    }
}