#include <iostream>
#include <limits>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <bitset>

using namespace std;

// 2D array - stack-based equivalent of "type name[x][y];"
#define a2d(type,name,x,y) type** name = new type*[x]; for(int i = 0; i < x; ++i) name[i] = new type[y];
#define fori(name,r) for (int name = 0; name < r; name++)
#define _in(type,name) type name; cin >> name
// inline version of _in(type,name)
#define _ini(type) []() { auto __f = []() { type __temp123; cin >> __temp123; return __temp123; }; static type __temp124 = __f(); return __temp124; }()

int main(int argc, char** argv)
{
   fori(ti,_ini(int)) {
   _in(int, n);
   int sum = 0;
   fori(i,n)
   {
      _in(int, x);
      sum = (sum + x)%3;
   }
   if (sum % 3 == 0)
      cout << "Yes" << endl;
   else
      cout << "No" << endl;
   }
   return 0;
}