#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long int gcd(long long int a, long long int b) {
  while (b) {
    long long int x = a % b;
    a = b;
    b = x;
  }
  return a;
}
long long int lcm(long long int a, long long int b) {
  return a / gcd(a, b) * b;
}
long long int qpow(long long int n, long long int k) {
  long long int ans = 1;
  assert(k >= 0);
  n %= mod;
  while (k > 0) {
    if (k & 1) ans = (ans * n) % mod;
    n = (n * n) % mod;
    k >>= 1;
  }
  return ans % mod;
}
int main() {
  int a, b, n, i, j, k, cnt = 1;
  cin >> n;
  int arr[n];
  cin >> arr[0];
  for (i = 1; i < n; i++) {
    cin >> arr[i];
    if (arr[i] >= arr[0] && arr[i] >= arr[i - 1]) cnt++;
  }
  cout << cnt << endl;
  return 0;
}
