#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979323846;
const long long mod = 998244353;
void unify(vector<int>& v) {
  auto ip = unique(v.begin(), v.end());
  v.resize(distance(v.begin(), ip));
}
long long gcd(long long x, long long y) { return y == 0 ? x : gcd(y, x % y); }
long long lcm(long long x, long long y) { return x * y / gcd(x, y); }
long long n, x;
bool check(long long mid, vector<long long>& sum) {
  for (int i = 1; i + mid - 1 <= n; i++) {
    if (sum[i + mid - 1] - sum[i - 1] > 100 * mid) return true;
  }
  return false;
}
void solve() {
  cin >> n;
  long long ans = 0;
  vector<long long> sum(n + 1, 0);
  for (int i = 1; i <= n; i++) {
    cin >> x;
    sum[i] = sum[i - 1] + x;
  }
  for (long long i = 1; i <= n; i++) {
    if (check(i, sum)) ans = i;
  }
  cout << ans << endl;
}
int main() {
  int t = 1;
  while (t--) solve();
}
