#include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #include<queue>

 #include<cmath>

 using namespace std;

 #define Maxn 1010

 #define INF 0xfffffff

 int a[*Maxn],sum[*Maxn];

 int f[*Maxn][*Maxn],s[*Maxn][*Maxn];

 int mymin(int x,int y) {return x<y?x:y;}

 int main()

 {

     int n;

     while(scanf("%d",&n)!=EOF)

     {

         for(int i=;i<=n;i++) scanf("%d",&a[i]);

         for(int i=;i<=n;i++) a[i+n]=a[i];

         sum[]=;

         for(int i=;i<=*n;i++) sum[i]=sum[i-]+a[i];

         memset(f,,sizeof(f));

         for(int i=;i<=*n;i++) f[i][i]=,s[i][i]=i;

         for(int i=*n;i>=;i--)

          for(int j=i+;j<=*n;j++)

          {

              if(j-i+>n) break;

              for(int k=s[i][j-];k<=s[i+][j];k++)

              {

                  if(f[i][j]>f[i][k]+f[k+][j]+sum[j]-sum[i-])

                  {

                     f[i][j]=f[i][k]+f[k+][j]+sum[j]-sum[i-];

                     s[i][j]=k;

                  }

              }

          }

         int ans=INF;

         for(int i=;i<=n;i++) ans=mymin(ans,f[i][i+n-]);

         printf("%d\n",ans);

     }

     return ;

 }