#include <bits/stdc++.h>
const int N = 5050;
int n, r[N];
int presum[N];
inline void init() {
  scanf("%d", &n);
  presum[0] = 0;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &r[i]);
    presum[i + 1] = r[i] + presum[i];
  }
}
int ans = 0;
inline void solve() {
  int j, tr = 0;
  for (int i = 0; i < n; ++i) {
    j = n;
    while (j > i) {
      if (presum[j] - presum[i] > 100 * (j - i)) {
        ans = std::max(ans, j - i);
        break;
      }
      --j;
    }
  }
}
inline void print() { printf("%d\n", ans); }
int main() {
  int t = 1;
  while (t--) {
    init();
    solve();
    print();
  }
  return 0;
}
