#include <bits/stdc++.h>
using namespace std;
int dp[300000];
int a[300000];
int n;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  dp[1] = 1;
  for (int i = 1; i <= n; i++) {
    if (a[i] > a[i - 1])
      dp[i] = max(dp[i - 1] + 1, dp[i]);
    else
      dp[i] = dp[i - 1];
  }
  cout << dp[n] << endl;
  return 0;
}
