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

vector<long> div(long n) {
  vector<long> v;
  for (long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      v.push_back(i);
      if (i * i != n) v.push_back(n / i);
    }
  }
  sort(begin(v), end(v));
  return v;
}

int main() {
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++) cin >> A.at(i);
  int acc = accumulate(A.begin(), A.end(), 0);
  for (auto a : div(acc)) {
    for (int i = 0, sum = 0, cnt = 0; i < N; i++) {
      sum += A.at(i);
      if (sum == a) cnt++, sum = 0;
      else if (sum > a) break;
      if (i == N - 1) {
        if (cnt == acc / a && !sum) return cout << acc / a << "\n", 0;
      }
    }
  }
}