import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      
      auto ASum = new int[N + 1];
      foreach (i; 0 .. N) {
        ASum[i + 1] = ASum[i] + A[i];
      }
      auto poss = new int[ASum[N] + 1];
      poss[] = -1;
      foreach (i; 0 .. N + 1) {
        poss[ASum[i]] = i;
      }
      
      int ans = 1;
      
      void check(int d) {
        for (int x = 0; x <= ASum[N]; x += d) {
          if (poss[x] == -1) {
            return;
          }
        }
        chmax(ans, ASum[N] / d);
      }
      
      for (int d = 1; d^^2 <= ASum[N]; ++d) {
        if (ASum[N] % d == 0) {
          check(d);
          if (d != ASum[N] / d) {
            check(ASum[N] / d);
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}