#include <iostream>
#include <vector>
using namespace std;
int INF=1e9;
int main()
{
    int n;cin>>n;
    vector<vector<int>> dp(n+1,vector<int>(n+1,INF));
    vector<int> costs(n+1);
    dp[0][0]=0;
    for(int i=1;i<=n;i++)
        {
        cin>>costs[i];
        dp[i][i]=costs[i];
        }
    for(int i=0;i<=n;i++)
        for(int j=i+1;j<=n;j++)
            dp[j][i]=0;
    for(int len=2;len<=n;len++)
        {
        for(int l=1;l+len-1<=n;l++)
            {
            int r=l+len-1;
            dp[l][r]=min(dp[l+1][r]+costs[l],dp[l][r-1]+costs[r]);
            for(int k=l+1;k<r;k++)
                {
                dp[l][r]=min(dp[l][r],max(dp[l][k-1],dp[k+1][r])+costs[k]);
                //cout<<len<<" "<<max(dp[l][k-1],dp[k+1][r])<<" "<<costs[k]<<" "<<k<<"\n";
                }

            }
        }
    cout<<dp[1][n];
    return 0;
}