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