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