#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<ctime>
#include<algorithm>
#include<iterator>
#include<iostream>
#include<cctype>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<list>
#define oo 1e9
#define tr(c, it) for(typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)
#define fi first
#define se second
#define pb push_back
#define sz size
#define ll long long
#define all(c) c.begin(), c.end()
#define PRE(i, m, n) for(int (i)=(m);(i)<(n);++(i))
#define present(container, element) (container.find(element) != container.end())
#define cpresent(container, element) (find(all(container), element) != container.end())
#define FOR(i,n) for(int (i)=0;(i)<(n);++(i))
using namespace std;
typedef pair<int, int> II;
typedef vector <int> VI;
typedef vector <II> VII;
typedef vector <VI> VVI;
typedef vector <VII> VVII;

 int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t; cin >> t;
    FOR(j, t) {
        int sum = 0;
        int n; cin >> n; VI a(n);
        FOR(i, n) {
            cin >> a[i];
            while(a[i] > 0) {
                sum += a[i] % 10;
                a[i] /= 10;
            }
        }
        if(sum % 3 == 0) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return 0;
}