#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
bool prime(long long x) {
  for (long long i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) return false;
  }
  return true;
}
long long kai(long long x) {
  if (x == 1) return 1;
  return kai(x - 1) * x;
}
long long mod_pow(long long x, long long y, long long moder) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x % moder;
    x = x * x % moder;
    y >>= 1;
  }
  return res;
}
long long n, h[20], ans;
signed main() {
  cin >> n;
  cin >> h[0];
  for (long long i = 1; i < n; i++) {
    cin >> h[i];
    if (h[0] <= h[i] && h[i - 1] <= h[i]) ans++;
  }
  cout << ans << endl;
}
