/* ****Enigma27**** */

#include<bits/stdc++.h>
#define ll          long long
#define pb          push_back
#define	endl		'\n'
#define pll         pair<ll int,ll int>
#define vll          vector<ll int>
#define all(a)      (a).begin(),(a).end()
#define x           first
#define y           second
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define rep(i,a,b)   for(ll i=a;ia<b;i++)
#define gcd(a,b)    __gcd((a),(b))
#define lcm(a,b)    ((a)*(b)) / gcd((a),(b))
const double 	pi=3.141592653589793238462643383279502884197169399375105820974944;
#define ios	    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
#define N	100005
ll n,i,j,k,l,sum=0,flag=0,ans=0,q,a[N];
map<ll,ll> m;
ll f(ll x){
	ll k=0;
	while(x>0){
		k+=x%10;
		x/=10;
	}
	return k;
}
int main()
{	
	ios
	cin>>q;
	while(q--){
		cin>>n;
		ans=0;
		for(i=0;i<n;i++){
			cin>>k;
			ans+=f(k);
		}
		if(ans%3==0) cout<<"Yes\n";
		else cout<<"No\n";
	}
	return 0;
}