#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
  ll N;
  cin >> N;
  vector<ll> H(N);
  for (int i = 0; i < (int)(N); i++) cin >> H[i];
  vector<ll> S(N, 0);
  for (int i = 0; i < (int)(N); i++) S[i + 1] = max(S[i], H[i]);
  ll ans = 0;
  for (int i = 0; i < (int)(N); i++)
    if (H[i] >= S[i + 1]) ans++;
  cout << ans << endl;
  return 0;
}
