#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int quersumme(int z)
{
    int s = 0;

    while(z != 0) {
        int last_dig = z%10;
        s += last_dig;
        z = z / 10;
    }
    return s;
}

string is_possible(vector<int> &an)
{
    int n = an.size();
    int qs = 0;
    //cout << "Checking possiblity for vector of length " << n << endl;
    for (int ii=0; ii<n; ii++) {
        //cout << an[ii] << " ";
        qs += quersumme(an[ii]);
    }
    //cout << "quersumme = " << qs << endl;
    if ((qs % 3) == 0) {
        return string("Yes");
    }
    return string("No");
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int t = 0;
    int n = 0;

    cin >> t;
    for (int query = 0; query < t; query++) {
        cin >> n;
        vector<int> an(n);
        for (int ii=0; ii<n; ii++) {
            cin >> an[ii];
        }

        cout << is_possible(an) << endl;
    }

    return 0;
}