#include <bits/stdc++.h>
int nums[(100000)] = {0};
int dp[(100000)] = {0};
int N;
int max(int a, int b) { return a > b ? a : b; }
int solve() {
  dp[0] = 1;
  int m = 1;
  for (int i = 1; i < N; i++) {
    if (nums[i] > nums[i - 1]) {
      dp[i] = dp[i - 1] + 1;
    } else {
      dp[i] = 1;
    }
    m = max(m, dp[i]);
  }
  return m;
}
int main() {
  scanf("%d ", &N);
  for (int k = 0; k < N; k++) {
    scanf("%d ", &nums[k]);
  }
  printf("%d\n", solve());
  return 0;
}
