1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

long long n, tab[1000007], diff[1000007], suma;
int ok[1000007];

vector <long long> dzielniki(long long x)
{
    vector <long long> v;
    for(long long i = 1; i*i <= x; i++)
        if(x % i == 0)
        {
            v.PB(i);
            v.PB(x/i);
        }
    return v;
}

vector <long long> czynniki(long long x)
{
    vector <long long> v;
    for(long long i = 2; i*i <= x; i++)
        while(x % i == 0)
        {
            v.PB(i);
            x /= i;
        }
    if(x > 1)
        v.PB(x);
    return v;
}

bool sprawdz(long long d)
{
//    cout << "sprawdza " << d << '\n';
    forr(i, n+3)
        diff[i] = 0;
    long long ile = 0;
    forr(i, n)
    {
        ile += diff[i];
        if(ile > tab[i])
            return 0;
        if(ile < tab[i])
        {
            diff[i + d] = - tab[i] + ile;
            ile = tab[i];
        }
    }
//    cout << ile << ", diff: " << diff[n] << '\n';
    return ile + diff[n] == 0;
}

int solve()
{
    cin >> n;
    forr(i, n)
    {
        cin >> tab[i];
        suma += tab[i];
    }
    
    auto dz = dzielniki(suma);
//    cout << "dzielniki " << suma  << ": ";
//    for(auto el : dz)
//        cout << el << ", ";
//    cout << '\n';

    long long res = 0;
    for(auto d : dz)
    {
        if(d <= n)
            if(sprawdz(d))
                res = max(res, d);
    }
    cout << res << '\n';

    return 0;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}