      PROGRAM Lower
      IMPLICIT NONE
      integer(16) :: n
      integer(16),allocatable :: h(:),diff(:)
      integer(16) :: ans=0,dist,i
      
      read*,n
      allocate( h(n),diff(n) )
      read*,h(1:n)
      
      diff(1:n-1) = h(2:n) - h(1:n-1)
      diff(n) = 10**9+1
      
      dist = 0
      do i = 1,n
        if( diff(i)<=0 )then
          dist = dist + 1
          ans = max( ans,dist )
        else
          dist = 0
        end if
      end do
      
      
      print*,ans
      
      
      END PROGRAM