#include <bits/stdc++.h>
using namespace std;
int incSeq(int* a, int n) {
  int best = 1;
  int last = 0;
  for (int i = 2; i <= n; i++) {
    if (last + best == i - 1 and a[i - 1] > a[i - 2])
      best++;
    else if (a[i - 1] > a[i - 2]) {
      best = (best <= i - last - best) ? (i - last) : best;
      last = (best <= i - last - best) ? (last + best) : last;
    } else {
      last = i - 1;
    }
  }
  return best;
}
int main(int argc, char const* argv[]) {
  int n;
  cin >> n;
  int array[n];
  for (int i = 0; i < n; i++) cin >> array[i];
  cout << incSeq(array, n);
  return 0;
}
