#include <bits/stdc++.h>
int mas[5000];
int ind;
int n;
int n1;
int M;
int T;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &mas[i]);
  }
  n1 = 0;
  M = 0;
  T = 0;
  for (int i = 0; i < n; i++) {
    M = 0;
    T = 0;
    for (int j = i; j < n; j++) {
      M += mas[j];
      T++;
      if ((T * 100) < M) {
        if (T > n1) n1 = T;
      }
    }
  }
  printf("%d", n1);
  return 0;
}
