#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  while (b) {
    int m = a % b;
    a = b;
    b = m;
  }
  return a;
}
int lcm(int a, int b) { return (a * b) / gcd(a, b); }
int isPrim(int a) {
  if (a == 1) {
    return 0;
  }
  for (int i = 2; i <= (a + 1) / 2; i++) {
    if (a % i == 0) {
      return 0;
    }
  }
  return 1;
}
long long mod_pow(long long x, long long n, long long mod) {
  long long ret = 1;
  while (n > 0) {
    if (n % 2 == 1) {
      ret = (ret * x) % mod;
    }
    x = (x * x) % mod;
    n = n / 2;
  }
  return ret;
}
struct VV {
  int x;
  int y;
  int z;
};
class LessInt {
 public:
  bool operator()(const VV& riLeft, const VV& riRight) const {
    if (riLeft.x == riRight.x) {
      return riLeft.y > riRight.y;
    }
    return riLeft.x > riRight.x;
  }
};
class indInt {
 public:
  bool operator()(const VV& riLeft, const VV& riRight) const {
    return riLeft.x < riRight.x;
  }
};
struct XX {
  int zenbu = 0;
  int kidoku = 0;
};
class xxIntu {
 public:
  bool operator()(const VV& riLeft, const VV& riRight) const {
    if (riLeft.z != riRight.z) {
      return riLeft.z > riRight.z;
    }
    return riLeft.y < riRight.y;
  }
};
bool operator<(const VV& riLeft, const VV& riRight) {
  return riLeft.z < riRight.z;
};
int main(int argc, const char* argv[]) {
  int n;
  cin >> n;
  int a[100000];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int max = -1;
  int len = 0;
  for (int i = 0; i < n; i++) {
    if (max < a[i]) {
      max = a[i];
      len++;
    } else if (max > a[i]) {
      max = a[i];
    }
  }
  cout << len << endl;
  return 0;
}
