#include <bits/stdc++.h>
using namespace std;
long long int MOD = 1000000007;
long long int MOD1 = 998244353;
mt19937 tw(chrono::high_resolution_clock::now().time_since_epoch().count());
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> a(n + 1);
  for (long long int i = 1; i <= n; i++) {
    cin >> a[i];
    a[i] += a[i - 1];
  }
  long long int m1 = 0;
  for (long long int i = 0; i <= n; i++) {
    long long int m2 = 0;
    for (long long int j = i + 1; j <= n; j++) {
      if ((a[j] - a[i]) > 100 * (j - i)) m2 = j - i;
    }
    if (m2 > m1) m1 = m2;
  }
  cout << m1 << '\n';
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
