#include <bits/stdc++.h>
using namespace std;
int main(void) {
  int N;
  cin >> N;
  vector<int> H(N);
  for (int i = 0; i < N; i++) {
    cin >> H[i];
  }
  int max = 0;
  int count = 0;
  for (int i = 0; i < N; i++) {
    if (i != 0) {
      count = H[i] - H[i - 1] > 0 && H[i] >= max ? count + 1 : count;
    }
    max = H[i] > max ? H[i] : max;
  }
  cout << count + 1 << endl;
  return 0;
}
