#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

void solve(int cs) {
  int n;
  cin >> n;
  map<int,int> v;
  int64_t S = 0;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    S += x;
    v[x % 3] += 1;
  }
  if (S % 3 == 0) cout << n << "\n";
  else if (S % 3 == 1) {
    if (v[1] > 0) cout << n - 1 << "\n";
    else cout << n - 2 << "\n";
  }  else {
    if (v[2] > 0) cout << n - 1 << "\n";
    else cout << n - 2 << "\n";
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1;
  cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}