#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const double PI = acos(-1);
const ll MOD = 1000000007;
using Graph = vector<vector<int>>;

int main() {
  int N; cin >> N;
  vector<int> a(N);
  rep(i,N) cin >> a[i];

  vector<int> b(N);
  b[0] = a[0];
  for (int i = 1; i < N; i++) b[i] = b[i-1] + a[i];
  
  vector<int> num(0);
  for (int i = 1; i * i <= b[N-1]; i++) {
    if (b[N-1] % i == 0) {
      num.push_back(i);
      num.push_back(b[N-1] / i);
    } 
  }

  sort(all(num));
  
  int ans;
  for (auto i : num) {
    int k = 0;
    rep(j,N) {
      if ((k+1) * i == b[j]) k++;
    }
    if (k * i == b[N-1]) {
      ans = k;
      break;
    }
  }

  cout << ans << endl;
}