#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<map>
#include <fstream>
#include<iostream>
#include<string>
#include<string.h>
#include<queue>
#include<time.h>
# define loopsn(i,n,s,e) for(int i=s;i<n-e;i++)
# define revloopsn(i,s,e) for(int i=s;i>=e;i--)
#define loop(i,n) for(int i=0;i<n;i++)

using namespace std;

typedef vector<long> vl;
typedef vector<vector<int>> vivi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vbvb;
typedef pair<int, int> pii;
typedef unsigned long long ull;


int main() {
	int t;
    cin>>t;
	loop(a0, t) {
		int n;
		cin >> n;
		vector<string> nums(n);
		loop(i, n)
			cin >> nums[i];
		int total = 0;
		loop(i, n) {
			loop(j, nums[i].size())
				total += nums[i][j]-'0';
		}
		if (total % 3 == 0)
			cout << "Yes"<<endl;
		else
			cout << "No"<<endl;
	}
	return 0;
}