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

#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqs             priority_queue<int,vi,greater<int> >
#define mod             1000000007
#define int             long long
#define pb              push_back
#define inf             1e18
#define sp(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(t)            int t; cin>>t; while(t--)
#define mp              make_pair
#define endl            "\n"
#define pqb             priority_queue<int>
#define ceil(a , b)     ((a / b) + (a%b && 1))
#define rep(i,a,b)      for(int i=a;i<(int)b;i++)
#define repr(i,a,b)     for(int i=a;i>=(int)b;i--)
#define fastio          ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define all(v)          v.begin(), v.end()
#define ff              first
#define ss              second
template<typename... T> void pn(T... args) { ((cout << args << " "), ...); cout<<"\n"; }
template<typename... T> void ps(T... args) { ((cout << args << " "), ...); cout<<""; }
// void start()
// {
//     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
// #endif
// }
int power(int a, int b,int P=mod) {
    int res = 1;
    for (; b; b >>= 1, a = 1ll * a * a % P)
        if (b & 1)
            res = 1ll * res * a % P;
    return res;
}

void solve()
{
    int n;
    cin>>n;
    int arr[n];
    int sum=0;
    vector<int>temp;
    int ans=n-1;
    for(int i=0; i<n; i++)
    {
        cin>>arr[i];
        sum+=arr[i];
        temp.pb(sum);
    }
    for(auto j:temp)
    {
        int i=0,cnt=0;
        sum=0;
        while(i<n)
        {
            sum+=arr[i];
            if(sum==j)
            {
                cnt++;
                sum=0;
            }
            else if(sum>j)
            {
                break;
            }
            i++;
        }
        if(i==n&&sum==0)
        {
            ans=min(ans,n-cnt);
        }
    }
    cout<<ans<<endl;

}
int32_t main()
{
    fastio;
    w(t)
    {
        solve();
    }

    return 0;
}