#include <bits/stdc++.h>
//#include <ext/pb_ds/detail/standard_policies.hpp>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

#define rep(i,n,s)		for(i=s;i<n;i++)
#define repr(i,n,s)		for(i=s;i>=n;i--)
#define all(c)			(c).begin(),(c).end()
#define allr(c)         (c).rbegin(),(c).rend()
#define loop(c,i)       for(typeof(c.begin()) i = c.begin(); i != c.end(); i++)
#define loopr(c,i)      for(typeof(c.end()) i = c.end(); i != c.begin(); )

#define ittr(v) typeof(v)::iterator

#define pb	push_back
#define mp 	make_pair
#define vi 	vector<int>
#define vl 	vector<long>
#define vpii 	vector< pair<int,int> >
#define vpil 	vector< pair<int,long> >
#define vpll 	vector< pair<long,long> >

#define pii 	pair<int,int>
#define piii	pair< pair<int,int>,int >
#define pll 	pair<long,long>
#define plll 	pair< pair<long,long>,long >

#define umii 	unordered_map<int,int>

using namespace std;
void solve()
{
	int n,i;
	cin>>n;
	long long a,ans=0;
	rep(i,n,0)
	{
		cin>>a;
		while(a)
		{
			ans += a%10;
			a/=10;
		}
	}
	if(ans%3 == 0)
		cout<<"Yes\n";
	else
		cout<<"No\n";
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		solve();
	}
}