#include <bits/stdc++.h>

using namespace std;

int n;
long long total;
long long T[100'005];
bool valid[100'005];


bool check_cand(int wave) {
    queue<pair<int, long long>> Q;
    Q.push({0, T[0]});
    long long curr_num = T[0];
    int idx = 1;

    while (idx < n) {
        while (!Q.empty() && idx - Q.front().first == wave) {
            curr_num -= Q.front().second;
            Q.pop();
        }
        
        if (T[idx] > curr_num) {
            if (idx + wave > n) {
                return false;
            }
            
            Q.push({idx, T[idx] - curr_num});
            curr_num = T[idx];
        } 
        else if (T[idx] < curr_num) {
            return false;
        }
        
        idx++;
    }

    return true;
}

void update_valid(int wave) {
    for (int i = wave; i < n; i += wave) {
        valid[i] = false;
    }
}


int main() {
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    cin >> n;

    int output = 1;
    for (int i = 0; i < n; ++i) cin >> T[i];
    for (int i = 0; i < n; ++i) total += T[i];
    for (int i = 0; i <= n; ++i) valid[i] = true;
    for (int i = 2; i <= n; ++i) {
        if (!valid[i]) continue;
        else if (total % i != 0) valid[i] = false;
        else if (!check_cand(i)) update_valid(i);
        else output = i;
    }
    
    cout << output;

    return 0;
}