//time complexity -
//space complexity -

//Submitted by Chunky_2808

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define For(i,a,b) for(i=a;i<b;i++)
#define Me(a,b) memset(a,b,sizeof(a))
#define pb push_back
#define mp make_pair
#define F first
#define S second

#define fs(a) fastscan(a)
#define ss set<ll>
#define vv vector<ll>
int main()
{
ll a,b,c,d,e,f,g,h;
cin>>a;
For(b,0,a)
{
    cin>>c;
    ll arr[c+1];
    For(d,0,c)
    cin>>arr[d];
    e=0;
    For(d,0,c)
    {
        e = e+ arr[d];
    }
    if(e%3==0)
        cout<<"Yes\n";
    else
        cout<<"No\n";
}}