#include <bits/stdc++.h>
using namespace std;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}
long long N;
vector<int> vec;
void solve() {
  int mn = 0;
  int ans = 0;
  for (long long i = 0; i < N; i++) {
    if (vec[i] >= mn) {
      ans++;
      mn = vec[i];
    }
  }
  cout << ans;
  return;
}
int main() {
  cin >> N;
  vec.resize(N);
  for (long long i = 0; i < N; i++) cin >> vec[i];
  solve();
  cout << endl;
  return 0;
}
