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
#include <bits/stdc++.h>
using namespace std;

const size_t MAX_N = 101000;

int n;
int bur[MAX_N];
int dod[MAX_N];

inline bool proba(int arg) {
	if (arg == 1) return true;
	
	for (int i = 0; i < n; i++) {
		int ong = bur[i-1];
		if (i >= arg) 
			ong -= dod[i - arg];
		
		if (ong > bur[i]) 
			return false;
		
		dod[i] = bur[i] - ong;
		
		if (dod[i] > 0 && i + arg > n) 
			return false; 
	}
	
	return true;
}

int main() {
	ios_base::sync_with_stdio(0);
	
	int64_t total = 0;
	
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> bur[i];
		total += bur[i];
	}
	
	for (int i = n; i >= 1; i--) {
		if (total % i) continue;
		
		if (proba(i)) {
			cout << i << endl;
			break;
		}
	}
	
	return 0;
}