#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[110][110];
ll currsumdp[110][110];
ll sum=0;
ll helper(ll i,ll n,ll part,ll curr,ll totsum,vector<ll>&a)
{
    if(i!=n and part==4) return 0;
    if(i==n) return(part==4)?1:0;
    if(currsumdp[i][part]) return dp[i][part];
    curr+=a[i];
    currsumdp[i][part]=1;
   return dp[i][part]=helper(i+1,n,part,curr,totsum,a)+((curr==(totsum/3)*part)?helper(i+1,n,part+1,curr,totsum,a):0);

}
ll solve(vector<ll>&a)
{
    ll n=a.size();
    for(auto it:a) sum+=it;
    if(n<3 or sum%3) return 0;
    memset(dp,-1,sizeof(dp));
    return helper(0,n,1,0,sum,a);
}
signed main() {
    ll n; cin>>n;
    vector<ll>a(n);
    for(ll i=0;i<n;i++) cin>>a[i];
    cout<<solve(a);
    return 0;
}

#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll solve(vector<char>&a)
{
    stack<char>st;
    ll n=a.size();
    ll i=0;
    while(i<n)
    {
        if(a[i]=='P')
        {
            i++;
            st.push(a[i]);
        }
        else if(a[i]=='B')
        {
            i++;
            if(st.top()==a[i]) st.pop();
            else break;
        }
        i++;
    }
    if(st.empty()) return -1;
    return st.size()+1;
}
signed main() {
     
     string s;
     getline(cin,s);
     vector<char>a;
     for(auto it:s)
        if(it!=' ') a.push_back(it);
     cout<<solve(a);

    return 0;
}

#include <bits/stdc++.h>
#include <vector>

using namespace std;

int main() {
    int N;
    cin >> N;
    vector<int> A(N + 1);
    for (int i = 1; i <= N; i++) {
        cin >> A[i];
    }

    vector<vector<int>> jump_count(N + 1, vector<int>(N + 1, 0));
    vector<bool> visited(N + 1, false);
    int total_distance = 0;

    for (int start = 1; start <= N; ++start) {
        if (visited[start]) continue;

        vector<int> trace;
        int current = start;
        while (!visited[current]) {
            visited[current] = true;
            trace.push_back(current);
            current = A[current];
        }

        int cycle_index = find(trace.begin(), trace.end(), current) - trace.begin();
        int cycle_length = trace.size() - cycle_index;

        for (int i = 0; i < trace.size(); ++i) {
            for (int j = i; j < trace.size(); ++j) {
                jump_count[trace[i]][trace[j]] = j - i;
                if (i != j) {
                    jump_count[trace[j]][trace[i]] = trace.size() - (j - i);
                }
            }
        }
    }

    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j) {
            total_distance += jump_count[i][j];
        }
    }

    cout << total_distance << endl;
    return 0;
}

#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> count(ll k,vector<ll>& a) {
    vector<ll> prime;
    for (ll i=2;i<=sqrt(k);i++) 
    {
        if (k%i==0) 
        {
            prime.push_back(i);
            while (k%i==0) k/=i;    
        }
    }
    if (k>1)prime.push_back(k);
    vector<ll>counts(prime.size(),0);
    for (auto num:a) 
    {
        for (ll i=0;i<prime.size();i++) 
        {
            ll factor=prime[i];
            while (num%factor==0) 
            {
                counts[i]++;
                num/=factor;
            }
        }
    }
    return counts;
}
ll helper(vector<ll>a,ll k)
{
     vector<ll>factorCounts=count(k,a);
    return factorCounts.empty()?0:*min_element(factorCounts.begin(), factorCounts.end());
}
signed main() {
    ll n, k; cin>>n>>k;
    vector<ll>a(n);
    for(ll i=0;i<n;i++) cin>>a[i];
    cout<<min(n,helper(a,k));
    return 0;
}