#include <bits/stdc++.h>
using namespace std;
long long int ans;
long long int prv[5000 + 5], a[5000 + 5];
long long int N;
int main() {
  cin >> N;
  for (int i = 1; i <= N; i++) cin >> a[i];
  for (int i = 1; i <= N; i++) prv[i] = prv[i - 1] + a[i];
  for (long long int i = 1; i <= N; i++)
    for (long long int j = i; j <= N; j++)
      if ((prv[j] - prv[i - 1]) > (j - i + 1) * 100) ans = max(ans, j - i + 1);
  cout << ans << "\n";
  return 0;
}
