The city of D consists of n towers, built consecutively on a straight line. The height of the tower that goes i-th (from left to right) in the sequence equals hi. The city mayor decided to rebuild the city to make it beautiful. In a beautiful city all towers are are arranged in non-descending order of their height from left to right.

The rebuilding consists of performing several (perhaps zero) operations. An operation constitutes using a crane to take any tower and put it altogether on the top of some other neighboring tower. In other words, we can take the tower that stands i-th and put it on the top of either the (i - 1)-th tower (if it exists), or the (i + 1)-th tower (of it exists). The height of the resulting tower equals the sum of heights of the two towers that were put together. After that the two towers can't be split by any means, but more similar operations can be performed on the resulting tower. Note that after each operation the total number of towers on the straight line decreases by 1.

Help the mayor determine the minimum number of operations required to make the city beautiful.

Input

The first line contains a single integer n (1 ≤ n ≤ 5000) — the number of towers in the city. The next line contains n space-separated integers: the i-th number hi (1 ≤ hi ≤ 105) determines the height of the tower that is i-th (from left to right) in the initial tower sequence.

Output

Print a single integer — the minimum number of operations needed to make the city beautiful.

Examples

Input

5
8 2 7 3 1


Output

3


Input

3
5 2 1


Output

2
#include <bits/stdc++.h>
using namespace std;
long long rez, s, dp[5010][5010], n, a[5010], k, k1, k2, i, j;
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) cin >> a[i];
  for (i = 0; i <= n; i++)
    for (j = 0; j <= n; j++) dp[i][j] = 1000000000;
  dp[0][0] = 0;
  for (i = 1; i <= n; i++) {
    k = -1;
    s = 0;
    for (j = i; j <= n; j++) {
      s += a[j];
      while (k < n && dp[i - 1][k + 1] <= s) k++;
      if (k >= 0 && dp[j][k + 1] > s) dp[j][k + 1] = s;
    }
    for (k = n - 1; k >= 0; k--)
      if (dp[i][k] > dp[i][k + 1]) dp[i][k] = dp[i][k + 1];
  }
  for (k = 1; k <= n; k++)
    if (dp[n][k] < 1000000000) rez = k;
  cout << n - rez << endl;
  return 0;
}
