#include <bits/stdc++.h>
using namespace std;
bool prime[1000000 + 1];
bool seive() {
  long long int N = 1e6 + 1;
  memset(prime, true, sizeof(prime));
  prime[0] = false;
  prime[1] = false;
  for (long long int i = 2; i * i <= N; i++) {
    if (prime[i]) {
      for (long long int j = i * i; j <= N; j += i) {
        prime[j] = false;
      }
    }
  }
}
bool isPowerOfTwo(int x) { return (x && !(x & (x - 1))); }
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int l = 0;
  int count = 1;
  for (int i = 1; i < n; i++) {
    if (arr[i] > arr[i - 1]) {
      count++;
    } else {
      l = (l < count ? count : l);
      count = 1;
    }
  }
  l = (l < count ? count : l);
  cout << l << endl;
  return 0;
}
