/**
 *    author:  math2do
 *    created: 23.01.2020 21:53:58
**/

#include <bits/stdc++.h>

using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "1" : "0");
}
string to_string(const char &ch) {
  return string(1, ch);
}
 
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  reverse(res.begin(), res.end());
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

//..import matrix, queue, stack

void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif


const long long pinf = (1ULL << 61) - 1;

vector <vector <long long>> dp;

long long solve(int l, int h, vector <long long> &sum, vector <int> &arr) {
  debug(l, h);
  if (l > h) return 0;
  if (l == h) return 0;
  if (l + 1 == h) {
    return (long long) arr[l] + arr[h];
  }
  if (dp[l][h] != -1) return dp[l][h];

  auto Get = [&](int i, int j) -> long long {
    if (i > j) return 0;
    long long rsum = sum[j];
    long long lsum = i - 1 >= 0 ? sum[i - 1] : 0;
    return rsum - lsum;
  };

  long long ans = pinf;
  for (int i = l; i <= h - 1; i++) {
    long long ll = solve(l, i, sum, arr);
    long long rr = solve(i + 1, h, sum, arr);
    long long cost = Get(l, i) + Get(i + 1, h);
    ans = min(ans, cost + ll + rr);
  }
  return dp[l][h] = ans;
} 

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector <int> arr(n);
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  vector <long long> sum(n, 0);
  sum[0] = arr[0];
  for (int i = 1; i < n; i++) {
    sum[i] = sum[i - 1] + arr[i];
  }

  dp.clear();
  dp.resize(n);
  for (int i = 0; i < n; i++) {
    dp[i].resize(n);
    fill(dp[i].begin(), dp[i].end(), -1LL);
  } 

  debug(arr);
  debug(sum);

  long long ans = solve(0, n - 1, sum, arr);
  cout << ans << '\n';
  return 0;
}


Measured memory_bytes: 1536