#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; #define fi first #define se second #define vi vector<int> #define vll vector<long long> #define pii pair<int, int> #define pll pair<long long, long long> #define pb push_back #define mp make_pair #define eb emplace_back #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count()); inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);} inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);} #ifdef DEBUG auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; struct pair_hash{ size_t operator()(const pair<int,int>&x)const{ return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32)); } }; const int MAXN = 5e2 + 7; int dp[MAXN][MAXN]; int add[MAXN][MAXN][MAXN]; int A[MAXN]; int pref[MAXN]; int n; void preprocessing(){ for(int i = 1; i <= n; i++){ pref[i] = pref[i - 1] + A[i]; } for(int i = 1; i <= n; i++){ for(int j = 0; j <= i - 1; j++){ int wsk = j - 1; int sum = A[j]; int wskR = j + 1; int sumR = A[j + 1]; int pre = 0; while(wskR < i && wsk > 0){ add[wsk][j][i] = pre; // cerr << wsk << ' ' << j << ' ' << i << ' ' << pre << ' ' << wskR << ' ' << sum << ' ' << sumR << '\n'; if(sum == sumR){ pre++; //add[wsk][j][i]++; sum += A[wsk]; wsk--; wskR++; sumR += A[wskR]; continue; } if(sumR < sum){ wskR++; sumR += A[wskR]; }else{ sum += A[wsk]; wsk--; } } while(wsk >= 0){ add[wsk][j][i] = pre; wsk--; } } } } int main(){ ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> n; for(int i = 1; i <= n; i++){ cin >> A[i]; } preprocessing(); for(int i = 1; i <= n; i++){ for(int j = 0; j <= i - 1; j++){ for(int z = 0; z <= j; z++){ dp[i][j] = max(dp[i][j], dp[j][z] + add[z][j][i]); } } } // cerr << add[0][2][4] << ' ' << add[2][4][6] << '\n'; int ans = 0; for(int i = 0; i <= n; i++){ ans = max(ans, dp[n][i]); } cout << ans << '\n'; return 0; }