11052.cpp

#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define ioa insert_or_assign
#define umap unordered_map
#define prq priority_queue
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vint;
const int INF = 0x3f3f3f3f; const int mINF = 0xc0c0c0c0;
const ll LINF = 0x3f3f3f3f3f3f3f3f; const ll mLINF = 0xc0c0c0c0c0c0c0c0;

int N;
int arr[1001];
int dp[1001];

void sol() {
	for(int i=1;i<=N;++i) {
		dp[i] = arr[i];
		for(int j=1;j<i;++j) {
			dp[i] = max(dp[i-j] + dp[j], dp[i]);
		}
	}
	cout << *max_element(dp,dp+N+1) << '\n';

	return;
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N;
	for(int i=1;i<=N;++i) {
		cin >> arr[i];
	}	
	sol();

	return 0;
}