#include <vector>
#include <list>
#include <map>
#include <set>
#include "queue"
#include <deque>
#include <stack>
#include <numeric>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <complex>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <climits>
#include <cassert>
#include <iostream>
#include "fstream"
#include  <unordered_set>
#include <unordered_map>
using namespace std;
#define PI acos(-1)
#define pii pair<long long ,long long >
#define ll  long long int
#define loop(i,n) for(int i=0;i<n;i++)
#define loop2(i,n) for(int i = 1;i<=n;i+=1)
ll mod_expo(ll MOD,ll a,ll b){ll ans =1;while (b) {if (b%2) {ans*=a;ans%=MOD;}b/=2;a*=a;a%=MOD;}return ans%MOD;}
#define pb push_back
#define mp make_pair
#define EPS 1e-8
void display(vector<int> v1){loop(i,v1.size()){cout<<v1[i]<<" ";}cout<<endl;}
int dx[8] = {0,1,0,-1,1,1,-1,-1};
int dy[8] = {1,0,-1,0,1,-1,1,-1};
using namespace  std;
//Hala Madrid

ll sum(ll   x)
{
    ll ans =0  ;
    while (x) {
        ans+=(x%10);
        x/=10;
    }
    return ans;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin>>t;
    while (t--) {
        int n;
        cin>>n;
        ll wow = 0 ;
        for (int i = 1; i<=n; i+=1) {
            ll x;
            cin>>x;
            wow+=sum(x);
        }
        if (wow%3) {
            cout<<"No";
        }
        else{
            cout<<"Yes";
        }
        cout<<endl;
    }
    
    
    
    return 0;
}