#include <bits/stdc++.h>
using namespace std;
queue<long> q;
int main() {
  long long num, a, ans = 1, sum = 1;
  cin >> num;
  cin >> a;
  q.push(a);
  for (int i = 1; i < num; i++) {
    cin >> a;
    q.push(a);
    if (q.back() > q.front()) {
      sum++;
    } else {
      sum = 1;
    }
    q.pop();
    if (sum >= ans) {
      ans = sum;
    }
  }
  cout << ans << endl;
  return 0;
}
