#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> // Common file //#include <ext/pb_ds/tree_policy.hpp> // Including seg_tree_order_statistics_node_update #include <stdio.h> #include <cassert> using namespace std; //using namespace __gnu_pbds; typedef long long lo; typedef long double ld; typedef pair<lo,lo> ll;//pair typedef vector<lo> vl; //vector of long typedef vector<ll > vll; //vector of pair typedef priority_queue<lo>p_q; typedef vector< vl > vvl; //vector of vectors #define X first #define Y second #define mp(a,b) make_pair((a),(b)) #define REP(a,b) for(lo i=(a);i<(lo)b;i++)//no need to declare variable i #define REPE(a,b,c,d) REP(a,b)for(lo j=(c);j<(lo)d;j++)//no need to declare vaiables i,j #define REPV(a,b,c) for(lo(a)=b;(a)<(c);(a)++)//a is the variable #define IREP(a,b) for(lo i=(a);i>=(b);i--) #define IREPV(a,b,c) for(lo(a)=b;(a)>=(c);(a)--) #define all(v) (v).begin(),(v).end() #define TRV(a) for(auto &it : a) #define INF 101000 #define MOD 1000000007 #define M 1000000007 #define BLOCK 300 #define CHECK_BIT(var,pos) ((var) & (1<<(pos))) #define pb(a) push_back((a)) #define eps 1e-2 #define PI acos(-1.0) #define debug(x) cout<<#x<<"="<<x<<endl #define debug2(x,y) cout<<#x<<"="<<x<<" "<<#y<<"="<<y<<endl; #define debug3(x,y,z) cout<<#x<<"="<<x<<" "<<#y<<"="<<y<<" "<<#z<<"="<<z<<endl; #define debug4(x,y,z,w) cout<<#x<<"="<<x<<" "<<#y<<"="<<y<<" "<<#z<<"="<<z<<" "<<#w<<"="<<w<<endl; #define debug5(x,y,z,w,t) cout<<#x<<"="<<x <<" ";debug4(y,z,w,t); #define debug6(p,x,y,z,w,t) cout<<#p<<" "<<p<<" "<<#x<<"="<<x <<" ";debug4(y,z,w,t); #define debug7(o,p,x,y,z,w,t) cout<<#o<<" "<<o<<" ";debug6(p,x,y,z,w,t); #define print_matrix(a,n,m) REPE(0,n,0,m){cout<<(a)[i][j]<<((j==m-1)?'\n':' ');} #define endl "\n" template<typename T> ostream& operator<< ( ostream &o,vector<T> v ) { if ( v.size() >0 )o<<v[0]; for ( unsigned i=1; i<v.size(); i++ )o<<" "<<v[i]; return o<<endl; } template<typename U,typename V> ostream& operator<< ( ostream &o,pair<U,V> p ) { return o<<"("<<p.first<<", "<<p.second<<") "; } template<typename T> istream& operator>> ( istream &in,vector<T> &v ) { for ( unsigned i=0; i<v.size(); i++ )in>>v[i]; return in; } template<typename T> istream& operator>> ( istream &in,pair <T,T> &p ) { in>>p.X; in>>p.Y; return in; } int main(){ std::ios::sync_with_stdio(false); cin.tie(0);cout.tie(0);cout.precision(20); lo t; cin>>t; while(t--){ lo n; cin>>n; vl a(n); cin>>a; lo sum=0; REP(0,n){ while(a[i]>0){ sum+=a[i]%10; a[i]/=10; } } if(sum%3==0)cout<<"Yes"<<endl; else cout<<"No"<<endl; } return 0; }