#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> h(n);
  for (int i = 0; i < (n); ++i) cin >> h[i + 1];
  int res = 1;
  int max_hight = h[1];
  for (int i = 2; i < (n); ++i) {
    max_hight = max(max_hight, h[i]);
    if (max_hight <= h[i])
      res++;
    else
      continue;
  }
  cout << res << endl;
  return 0;
}
