/*
 _____ _             _              _           _
|_   _| |__   ___   / \   _ __  ___| |__  _   _| |
  | | | '_ \ / _ \ / _ \ | '_ \/ __| '_ \| | | | |
  | | | | | |  __// ___ \| | | \__ \ | | | |_| | |
  |_| |_| |_|\___/_/   \_\_| |_|___/_| |_|\__,_|_|

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll          long long
#define pb          push_back
#define ppb         pop_back
#define	endl		'\n'
#define mii         map<ll,ll>
#define msi         map<string,ll>
#define mis         map<ll, string>
#define rep(i,a,b)    for(ll i=a;i<b;i++)
#define repr(i,a,b) for(ll i=b-1;i>=a;i--)
#define trav(a, x) 	for(auto& a : x)
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define vii         vector<pair<ll, ll>>
#define vs          vector<string>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll)x.size()
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound

/*	For Debugging	*/
#define DEBUG 		cerr<<"/n>>>I'm Here<<</n"<<endl;
#define display(x) trav(a,x) cout<<a<<" ";cout<<endl;
#define what_is(x)  cerr << #x << " is " << x << endl;

std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define TIME        cerr << "\nTime elapsed: " << setprecision(5) <<1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
#define DECIMAL(n)  cout << fixed ; cout << setprecision(n);
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace __gnu_pbds;
using namespace std;
#define PI 3.141592653589793
#define N  100005
#define M 	128
#define T 	7
map<ll,ll> tst;
vi ps;
ll dp[N][M][T];
// ll v[N][T];
ll n,pw[T];
void clean()
{
	ps.clear();
}

ll fun(ll i,ll mask,ll p)
{
	// cout<<i<<" "<<mask<<endl;
	if(i>=n)
	{
		return 0;
	}
	if(dp[i][mask][p]!=-1)
		return dp[i][mask][p];
	if(mask&ps[i])
	{
		dp[i][mask][p]=fun(i+1,mask,p)+(p!=ps[i]);
		// cout<<i<<" "<<mask<<" "<<p<<" "<<dp[i][mask][p]<<endl;
		return dp[i][mask][p];
	}
	dp[i][mask][p]=fun(i+1,mask+pw[ps[i]],ps[i]);
	// cout<<i<<" "<<mask<<" "<<p<<" "<<dp[i][mask][p]<<endl;
	return dp[i][mask][p];
}


void solve()
{
	ll x;
	cin>>n;
	rep(i,0,n)
	{
		cin>>x;
		if(sz(ps)==0 || tst[x]!=ps.back())
		{
			ps.pb(tst[x]);
		}
	}
	n=sz(ps);
	// rep(i,0,n)
	// {
	// 	v[i][ps[i]]=1;
	// }
	// rep(j,0,T)
	// {
	// 	repr(i,0,n-1)
	// 		v[i][j]+=v[i+1][j];
	// }
	rep(i,0,n+1)
	{
		rep(j,0,M)
		{
			rep(k,0,T)
				dp[i][j][k]=-1;
		}
	}
	ll mn=LLONG_MAX;
	rep(i,0,T)
		mn=min(mn,fun(0,pw[i],i));
	cout<<mn<<endl;
	clean();
	return;
}
int main()
{
	FAST
	int TESTS=1;
	pw[0]=1;
	rep(i,1,T)
	pw[i]=2*pw[i-1];
	tst[10]=0;
	tst[20]=1;
	tst[50]=2;
	tst[100]=3;
	tst[200]=4;
	tst[500]=5;
	tst[2000]=6;
	cin>>TESTS;
	while(TESTS--)
	{
		solve();
	}
	TIME
	return 0;
}