n = gets.to_i
h = gets.split(' ').map(&:to_i)

max = 0
i=0
long=0

while i<=n-2
  if h[i]<h[i+1]
    if long>max
      max = long
      long = 0
      i+=1
    else
      i+=1
      long=0
    end
  else
    long += 1
    i+=1
  end
end

if long>max
  max = long
end
puts max
