#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
const long long mod = 1e9 + 7;
const long long MAX_N = 5e5 + 5;
long long dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<long long> prime;
long long inv[MAX_N], fac[MAX_N];
template <class T = long long>
T in() {
  T x;
  cin >> x;
  return (x);
}
inline long long GCD(long long a, long long b) {
  long long c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
inline long long LCM(long long a, long long b) { return a * b / GCD(a, b); }
inline long long POW(long long a, long long b) {
  long long c = 1;
  while (b > 0) {
    if (b & 1) {
      c = a * c % mod;
    }
    a = a * a % mod;
    b >>= 1LL;
  }
  return c;
}
inline void _nCr() {
  fac[0] = 1;
  for (long long i = 1LL; i < MAX_N; i++) {
    fac[i] = fac[i - 1] * i % mod;
  }
  for (long long i = 0; i < MAX_N; i++) {
    inv[i] = POW(fac[i], mod - 2);
  }
}
inline long long nCr(long long n, long long r) {
  return (fac[n] * inv[r] % mod) * inv[n - r] % mod;
}
inline void PRI(long long n) {
  bool a[n + 1];
  for (long long i = 0; i < n + 1; i++) {
    a[i] = 1;
  }
  for (long long i = 2; i < n + 1; i++) {
    if (a[i]) {
      prime.push_back(i);
      long long b = i;
      while (b <= n) {
        a[b] = 0;
        b += i;
      }
    }
  }
}
signed main() {
  long long n;
  cin >> n;
  long long h[n];
  for (long long(i) = (0); (i) < (n); (i)++) cin >> h[i];
  long long ans = 1;
  long long ma = h[0];
  for (long long(i) = (1); (i) < (n); (i)++) {
    if (h[i] > ma) ans++;
    ma = max(ma, h[i]);
  }
  cout << ans << endl;
}
