#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int N;
vector<int> sums;

bool isok(int x, int l, int K){
  // code here
  if(sums[x]-sums[l-1]>=K) return true;
  else return false;
}

int binsch(int l, int K){
  // set value
  int ng = l-1; int ok = N+1;
  while(abs(ok-ng)>1){
    ll mid = (ok+ng)/2;
    if(isok(mid, l, K)) ok = mid;
    else ng = mid;
  }
  if(sums[ok]-sums[l-1]==K) return ok;
  else return -2;
}

int main(){
  cin >> N;
  vector<int> A(N); rep(i,N) cin >> A[i];
  sums.resize(N+1); sums[0] = 0;
  rep(i,N) sums[i+1] = sums[i] + A[i];
  for(int i=1; i<=N; i++){
    int goal = sums[i];
    if(sums[N]%goal) continue;
    int ans = sums[N]/goal;
    int l=i+1;
    rep(j,ans-1){
      if((l = binsch(l,goal)+1) < 0){
        break;
      }
      if(j+1 == ans-1){
        cout << ans << endl;
        return 0;
      }
    }
  }
  cout << 1 << endl;
  return 0;
}