#include <bits/stdc++.h>
using namespace std;
long long tmp, n, a[5010], ans;
int main() {
  scanf("%lld", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  for (int i = 1; i <= n; i++) {
    tmp = 0;
    for (long long j = 1; i + j - 1 <= n; j++) {
      tmp += a[i + j - 1];
      if (tmp > 1ll * 100 * j) ans = max(ans, j);
    }
  }
  printf("%lld\n", ans);
  return 0;
}
