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