#include <bits/stdc++.h>
int max(int, int);
int main() {
  int N, i, count = 0, M = 0;
  int H[N];
  scanf("%d", &N);
  for (i = 0; i < N; i++) {
    scanf("%d", &H[i]);
  }
  for (i = 1; i < N; i++) {
    M = max(M, H[i - 1]);
    if (H[i] >= M) {
      count++;
    }
  }
  printf("%d", count);
  return 0;
}
int max(int a, int b) {
  int M = 0;
  if (a > b) {
    M = a;
  } else {
    M = b;
  }
  return M;
}
