#include <bits/stdc++.h>
using namespace std;
long long n;
long long x[1000100];
long long temp;
long long ans;
long long mem[10000100];
long long dfs(long long n) {
  if (mem[n] != 0) ans = mem[n];
  if (n == 0)
    temp = 1;
  else if (x[n] >= x[n + 1])
    temp = dfs(n - 1);
  else
    temp = dfs(n - 1) + 1;
  if (temp > ans) ans = temp;
  temp = 0;
  return mem[n] = ans;
}
signed main() {
  cin >> n;
  for (long long i = 0; i <= n; i++) mem[i] = -1;
  for (long long i = 1; i <= n; i++) cin >> x[i];
  cout << dfs(n) << endl;
  return 0;
}
