#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  long long temp;
  while (1) {
    if (b % a == 0) return a;
    temp = a;
    a = b % a;
    b = temp;
  }
}
int main() {
  long long n, m, p, q, c, i, x, j, t, k, sum = 0, cnt = 0, ans, res;
  cin >> n;
  long long a[n];
  for (i = 0; i < n; i++) cin >> a[i];
  cnt = 1;
  ans = 1;
  for (i = 1; i < n; i++) {
    if (a[i] > a[i - 1])
      cnt++;
    else
      cnt = 1;
    ans = max(ans, cnt);
  }
  cout << ans << endl;
  return 0;
}
