#include <bits/stdc++.h>
const long long INF = 0x3f3f3f3f;
const double E = exp(1);
const double PI = acos(-1);
using namespace std;
long long kc(long long a, long long b) {
  long long c = 1;
  while (b) {
    if (b & 1) c *= a;
    a *= a;
    b >>= 1;
  }
  return c;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int s[200003];
bool cmp(int a, int b) { return a > b; }
int main() {
  int n, a[30], b[30], sum;
  sum = 0;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  int Max = 0;
  for (int i = 1; i <= n; i++) {
    if (s[i] >= Max) {
      sum++;
    }
    Max = max(Max, s[i]);
  }
  cout << sum << endl;
}
