#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
int n;
int a[maxn];
int dp[maxn];
void solve() {
  memset(dp, 0, sizeof(dp));
  dp[0] = 1;
  for (int i = 1; i <= n; i++) {
    if (a[i] > a[i - 1])
      dp[i] = dp[i - 1] + 1;
    else
      dp[i] = dp[i - 1];
  }
  printf("%d\n", dp[n]);
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  solve();
  return 0;
}
