/* 
*   @author:- SYEDA SADIATUL JANNAT TUSHI
*   date & time :2025-01-02 20:29:39
*   BANGLADESH , SYLHET. 
*/

#include <bits/stdc++.h>
using namespace std;

#define endl          '\n'
#define ll            long long
#define vi            vector<ll>
#define pii           pair<ll,ll>
#define vii           vector<pii>
#define sz(x)         (int)x.size()
#define be(x)         x.begin(), x.end()
#define srt(v)         sort(v.begin(),v.end())
#define rsrt(v)        sort(v.rbegin(),v.rend())
#define fl(i, a, b)   for(ll i = (a); i < (b); i++)
#define print(v)      for(auto e:v) cout<<e<<" "; cout<<endl;
#define InShaAllah    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

void solve() {
    ll n;
    cin>> n;

    vi a(n);

    ll cnt1=0,cnt0=0,cntm=0;

    fl(i,0,n){
        cin>> a[i];
        if(a[i]==1)cnt1++;
        else if(a[i]==0)cnt0++;
        else{cntm++;}
    }

    ll ans=0;

    ll p=cntm/2;
    ll t1= min(p,cnt1);
    ans+=t1;
    cntm-=2*t1;
    cnt1-=t1;

    ll t2 = cnt1/3;
    ll rem = cnt1%3;
    ans+=t2;

    if(cnt1==2 && cntm==1){
        ans+=-1;
        cnt1=0;
        cntm=0;
    }

    cout<< ans <<endl;

}

int main() {
    InShaAllah
    ll t = 1;
    cin >> t;

    while (t--) {
        solve();
    }
    return 0;
}