#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const double EPS = 1e-7;
const int INF = 1e9 + 1;
template <typename A, typename B>
istream &operator>>(istream &in, pair<A, B> &p) {
  in >> p.first >> p.second;
  return in;
}
template <typename A, typename B>
ostream &operator<<(ostream &out, pair<A, B> &p) {
  out << "(" << p.first << " " << p.second << ")";
  return out;
}
template <typename I>
istream &operator>>(istream &in, vector<I> &a) {
  for (auto &i : (a)) in >> i;
  return in;
}
template <typename I>
ostream &operator<<(ostream &out, vector<I> &a) {
  for (int i = 0; i < ((int)(a).size()); ++i) {
    if (i) out << " ";
    out << a[i];
  }
  return out;
}
void fast_io() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin.exceptions(cin.failbit);
}
void solve_test() {
  int n;
  cin >> n;
  vector<int> a(n);
  cin >> a;
  int best = 0;
  for (int i = 0; i < (n); ++i) {
    int sum = 0;
    for (int j = 0; j < (n - i); ++j) {
      sum += a[i + j];
      if (sum > 100 * (j + 1)) best = max(best, j + 1);
    }
  }
  cout << best << endl;
}
int main() {
  srand(time(0));
  int t = 1;
  while (t--) {
    solve_test();
  }
}
