#include <bits/stdc++.h>
using namespace std;
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
vector<long long> G[500005];
vector<pair<long long, long long> > tree[500010];
priority_queue<long long> pql;
priority_queue<pair<long long, long long> > pqp;
priority_queue<long long, vector<long long>, greater<long long> > pqls;
priority_queue<pair<long long, long long>, vector<pair<long long, long long> >,
               greater<pair<long long, long long> > >
    pqps;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
long long mod = 1000000007;
long long rui(long long number1, long long number2) {
  if (number2 == 0) {
    return 1;
  } else {
    long long number3 = rui(number1, number2 / 2);
    number3 *= number3;
    number3 %= mod;
    if (number2 % 2 == 1) {
      number3 *= number1;
      number3 %= mod;
    }
    return number3;
  }
}
long long gcd(long long number1, long long number2) {
  if (number1 > number2) {
    swap(number1, number2);
  }
  if (number1 == 0 || number1 == number2) {
    return number2;
  } else {
    return gcd(number2 % number1, number1);
  }
}
void YES(bool condition) {
  if (condition) {
    cout << "YES" << endl;
    ;
  } else {
    cout << "NO" << endl;
    ;
  }
  return;
}
void Yes(bool condition) {
  if (condition) {
    cout << "Yes" << endl;
    ;
  } else {
    cout << "No" << endl;
    ;
  }
  return;
}
long long n, m, num, sum, ans, a, b, c, d, e, g, h, w, i, j, k, q, l, r;
long long x[500005], y[500005], z[500005];
long long dp[500005][6], sc[500005][6];
bool flag, dame;
long long fact[400005];
long long rfact[400005];
void c3_init() {
  fact[0] = rfact[0] = 1;
  for (long long i = 1; i < 400000; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
    rfact[i] = rui(fact[i], mod - 2);
  }
}
long long c3(long long n, long long r) {
  return (((fact[n] * rfact[r]) % mod) * rfact[n - r]) % mod;
}
int main() {
  cin >> n;
  num = -INF;
  for (i = 0; i < n; i++) {
    cin >> x[i];
    if (x[i] > num) ans++;
    num = max(num, x[i]);
  }
  cout << ans << endl;
  ;
  return 0;
}
