#include <bits/stdc++.h>
const long long INF = -10000000000;
using namespace std;
long long dp[10001] = {};
long long ans[10001] = {};
int N;
long long a[100000] = {};
int main() {
  cin >> N;
  for (int i = 0; i < N; i++) cin >> a[i];
  for (int i = 0; i < N; i++) {
    int tmp = 1;
    for (int j = i; j < N; j++) {
      if (i == j)
        dp[j] = 1;
      else if (a[j - tmp] < a[j]) {
        dp[j] = dp[j - 1] + 1;
        tmp = 1;
      } else {
        dp[j] = dp[j - 1];
        tmp++;
      }
      if (j == N - 1) ans[i] = dp[N - 1];
    }
  }
  sort(ans, ans + N);
  reverse(ans, ans + N);
  cout << ans[0] << endl;
  return 0;
}
