#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;

#define newline '\n';
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FAST_IO  ios_base::sync_with_stdio(false)

const int PI = acos(-1.0);
const int MOD = 1e9 + 7;

int sumOfDigits(int val) {
	int result = 0;
	while (val > 0) {
		result += (val % 10);
		val /= 10;
	}
	return result;
}

int cnt[10];

int canConstruct(vector<int> candidates) {
	int temp = 0;
	for (auto elem: candidates) {
		temp += sumOfDigits(elem);
	}
	return temp % 3 == 0;
}

int main() {
	int tc;
	cin >> tc;
	while(tc--) {
		int n;
		cin >> n;
		vector<int> arr;
		arr.resize(n);
		for (int i = 0; i < n; ++i) {
			cin >> arr[i];
		}
		if (canConstruct(arr)) {
			cout << "Yes\n";
		} else cout << "No\n";
	}
	return 0;
}