#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    int N;
    cin >> N;
    int a[N];
    vector<int> b(N + 1);
    b[0] = 0;
    
    for (int i = 0; i < N; i++) {
        cin >> a[i];
        b[i + 1] = b[i] + a[i];
    }
    int ans = 1;
    int s = 0;
    for (int i = 0; i < N; i++) {
        int v = b[i + 1];
        s = v;
        int t = 0;
        int l = i + 2;
        int cnt = 1;
        while (l < N) {
            auto it = lower_bound(b.begin() + l, b.end(), v + s);
            int id = it - b.begin();
            if (b[id] == v + s) {
                s = b[id];
                l = id;
                cnt++;
            } else {
                break;
            }
            if (id == N) {
                ans = max(ans, cnt);
            }
        }
    }
    cout << ans << "\n";
    return 0;
}