#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { int n; cin >> n; int a[n]; int sum = 0; rep(i,n){ cin >> a[i]; sum += a[i]; } srep(i,1,sum+1){ if(sum % i != 0)continue; int now = 0; rep(j,n){ now += a[j]; if(now == i)now = 0; } if(now == 0){ cout << sum / i << endl; break; } } return 0; }