#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9 + 7;
const int  N = 2e5 + 5;

int t, n, a[N];

signed main(){
	IOS;
	cin >> t;
	while(t --){
        cin >> n;
        int sum = 0;
        for(int i = 1; i <= n; i ++){
            cin >> a[i];
            sum += a[i];
        }
        int tmp = 0, ok = 1;
        for(int i = 1; i <= n; i ++){
            tmp += a[i];
            if(sum%tmp==0){
                int cmp = 0, cnt = 1;
                for(int j = i+1; j <= n; j ++){
                    cmp += a[j];
                    if(cmp==tmp) cnt ++, cmp = 0;
                }
                if(cnt==sum/tmp){
                    ok = 1;
                    break;
                }
            }
        }
        cout << n-sum/tmp << endl;
	}

	return 0;
}
