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
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define FORD(i, a,  b) for (auto i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ITH_BIT(m, i) ((m)>>(i) & 1)
#define PPC(x) __builtin_popcount(x)

#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = std::min(a, (T1)b);	}
template <typename T1, typename T2> inline void remax(T1& a, T2 b) { a = std::max(a, (T1)b);	}

const int maxN = 1 << 22, mod = 1'000'000'007;

int n, T[maxN], toDrop[maxN];

bool check(int k)
{
	std::fill(toDrop, toDrop + n, 0);
	int opens = 0;

	FOR(i, 0, n)
	{
		opens -= toDrop[i];
		int left = T[i] - opens;

		if (left < 0)
			return false;

		if (left > 0 and i+k > n)
			return false;

		toDrop[i + k] += left;
		opens += left;
	}
	return true;
}

auto getDivs(long long x)
{
	std::vector <long long> divs;
	for (int i=1; 1ll*i*i<=x; i++)
		if (x % i == 0)
			divs.push_back(i), divs.push_back(x / i);
	return divs;
}

void solve()
{
	scanf ("%d", &n);
	long long sum = 0;
	FOR(i, 0, n)
		scanf ("%d", T+i), sum += T[i];
	
	auto D = getDivs(sum);
	int res = 1;
	for (long long d : D)
		if (res < d and d <= n and check(d))
			res = d;
	printf("%d\n", res);
}

int main()
{
	int tc = 1;
//	scanf ("%d", &tc);

	FOR(cid, 1, tc+1)
	{
//		printf("Case #%d: ", cid);
		solve();
	}
	return 0;
}