codeforces-merge it solution

#include<bits/stdc++.h>
using namespace std;
int main()
{
 int t;
 cin>>t;
 for(int i=1;i<=t;i++)
 {
  int count[3]={0};
  int n;
  cin>>n;
  for(int j=0;j<n;j++)
  {
   long x;
   cin>>x;
   count[x%3]++;
  }
  int result=count[0];
  int t=min(count[1],count[2]);
  result+=t;
  count[1]-=t;
  count[2]-=t;
  result+=(count[1]+count[2])/3;
  cout<<result<<endl;
 }
 return 0;
}