#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<deque>
#include<cassert>
using namespace std;

#define sz(x) (int)(x.size())
#define fi(a,b) for(int i=a;i<b;++i)
#define fj(a,b) for(int j=a;j<b;++j)
#define fo(a,b) for(int o=a;o<b;++o)
#define fdi(a,b) for(int i=a-1;i>=b;--i)
#define fdj(a,b) for(int j=a-1;j>=b;--j)
#define fdo(a,b) for(int o=a-1;o>=b;--o)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
//////////////////////

int const N = 1e5 + 41;

int n, a[N];
int s;

void solve(){
	s = 0;
	fi(0, n){
		int v = a[i];
		while(v){
			s += (v % 10);
			v /= 10;
		}
	}
}

int main(){
#ifdef _DEBUG
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
#endif

	int t;
	scanf("%d",&t);
	while(t--){

		scanf("%d",&n);
		fi(0, n) scanf("%d",&a[i]);

		solve();
		if(s % 3 == 0) printf("Yes\n");
		else printf("No\n");
	}

	return 0;
}