#include <bits/stdc++.h>
using namespace std;
int Top(int j, vector<int> &H) {
  int max_height = 0;
  for (int k = 0; k < j; k++) {
    max_height = max(max_height, H[k]);
  }
  return max_height;
}
int main() {
  int N;
  vector<int> H(N);
  cin >> N;
  for (int l = 0; l < N; l++) {
    cin >> H[l];
  }
  int cnt = 0;
  for (int i = 1; i < N; i++) {
    int a = i - 1;
    if (Top(a, H) <= H[i]) {
      cnt++;
    }
  }
  cout << cnt + 1 << endl;
  return 0;
}
