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