#include <bits/stdc++.h>
const int inf = int(2e9);
const int mod = inf + 7;
using namespace std;
void solve() {
  int n;
  cin >> n;
  int a[n];
  int pref[n], suff[n];
  for (int i = 0; i < n; ++i) cin >> a[i];
  pref[0] = a[0];
  suff[n - 1] = a[n - 1];
  for (int i = 1; i < n; ++i) {
    pref[i] = max(pref[i - 1], a[i]);
  }
  int cnt = 1;
  for (int i = n - 1; i >= 0; --i) {
    if (a[i] >= pref[i - 1]) cnt++;
  }
  cout << cnt;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
