/* -*- coding: utf-8 -*-
 *
 * 944.cc:  No.944 煎っぞ! - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

/* typedef */

typedef vector<int> vi;

/* global variables */

int ass[MAX_N + 1], ps[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) {
    int ai;
    scanf("%d", &ai);
    ass[i + 1] = ass[i] + ai;
  }

  int sum = ass[n], m = 0;
  for (int p = 1; p * p <= sum; p++)
    if (sum % p == 0) {
      int q = sum / p;
      ps[m++] = p;
      if (p != q) ps[m++] = q;
    }
  sort(ps, ps + m);
  //printf("sum=%d, m=%d\n", sum, m);

  for (int i = 0; i < m; i++) {
    int pi = ps[i], qi = sum / pi;
    //printf("pi=%d, qi=%d\n", pi, qi);
    bool ok = true;
    for (int j = 1, pj = pi; ok && j < qi; j++, pj += pi) {
      int k = lower_bound(ass, ass + n, pj) - ass;
      ok = (ass[k] == pj);
    }

    if (ok) {
      printf("%d\n", qi);
      break;
    }
  }
  
  return 0;
}