#include<bits/stdc++.h>

using namespace std;
//using namespace __gnu_pbds;

typedef long long int	ll;
typedef long double	ld;
typedef pair<ll,ll>   ii;
typedef vector< ii >   vii;
typedef vector<ll>     vi;
typedef vector< vi >   vvi;
//typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define mm 1000005
#define nn 5005
#define xx real()
#define yy imag()
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define forn(i, n) for(ll i = 0; i < ll(n); ++i)
#define rep(i, a, b) for(ll i = ll(a); i <= ll(b); ++i)
#define cases ll t;  cin>>t;   while(t--)
#define chck(a,n) forn(iiii,ll(n)) cout<<ll(a[iiii])<<" "; cout<<endl
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
int a[mm];

int main()
{
    fast_io;
    cases
    {
        int n;
        ll sum=0;
        cin>>n;
        forn(i,n) cin>>a[i],sum+=a[i];
        if(sum%3==0) cout<<"Yes\n";
        else cout<<"No\n";
    }
    return 0;
}